True measures of GDP and convergence

Widely used ''purchasing power parity'' comparisons of per capita GDP are not true quantity indexes and are subject to systematic substitution bins. This bias may distort measurement of convergence and divergence. Extending Varian's nonparametric construction of a true index gives the set of true indexes, including the new Ideal Afriat Index. These indexes are utility-consistent and independent of arbitrary reference price vectors. We establish bounds on the dispersion of true multilateral indexes, hence bounds on convergence. International price indexes understate both true GDP dispersion and, where prices are converging over time, the rate of true quantity convergence.

One-dimensional point interaction with three complex parameters

For a pair of non-Hermitian Hamiltonian H and its Hermitian adjoint H(dagger), there are situations in which their eigenfunctions form a biorthogonal system. We illustrate such a situation by means of a one-particle system with a one-dimensional point interaction in the form of the Fermi pseudo-potential. The interaction consists of three terms with three strength parameters g(i) (i = 1, 2 and 3), which are all complex. This complex point interaction is neither Hermitian nor PT-invariant in general. The S-matrix for the transmission reflection problem constructed with H (or with H(dagger)) in the usual manner is not unitary, but it conforms to the pseudo-unitarity that we define. The pseudounitarity is closely related to the biorthogonality of the eigenfunctions. The eigenvalue spectrum of H with the complex interaction is generally complex but there are cases where the spectrum is real. In such a case H and H(dagger) form a pseudo-Hermitian pair.

Topological methods for some boundary value problems

We establish existence of solutions for a finite difference approximation to y = f(x, y, y ') on [0, 1], subject to nonlinear two-point Sturm-Liouville boundary conditions of the form g(i)(y(i),y ' (i)) = 0, i = 0, 1, assuming S satisfies one-sided growth bounds with respect to y '. (C) 2001 Elsevier Science Ltd. All rights reserved.

Monolithic CAD/CAM Lithium Disilicate Versus Veneered Y-TZP Crowns: Comparison of Failure Modes and Reliability After Fatigue

Purpose: The aim of this research was to evaluate the fatigue behavior and reliability of monolithic computer-aided design/computer-assisted manufacture (CAD/CAM) lithium disilicate and hand-layer-veneered zirconia all-ceramic crowns. Materials and Methods: A CAD-based mandibular molar crown preparation, fabricated using rapid prototyping, served as the master die. Fully anatomically shaped monolithic lithium disilicate crowns (IPS e.max CAD, n = 19) and hand-layer-veneered zirconia-based crowns (IPS e.max ZirCAD/Ceram, n = 21) were designed and milled using a CAD/CAM system. Crowns were cemented on aged dentinlike composite dies with resin cement. Crowns were exposed to mouth-motion fatigue by sliding a WC-indenter (r = 3.18 mm) 0.7 mm lingually down the distobuccal cusp using three different step-stress profiles until failure occurred. Failure was designated as a large chip or fracture through the crown. If no failures occurred at high loads (> 900 N), the test method was changed to staircase r ratio fatigue. Stress level probability curves and reliability were calculated. Results: Hand-layer-veneered zirconia crowns revealed veneer chipping and had a reliability of < 0.01 (0.03 to 0.00, two-sided 90% confidence bounds) for a mission of 100,000 cycles and a 200-N load. None of the fully anatomically shaped CAD/CAM-fabricated monolithic lithium disilicate crowns failed during step-stress mouth-motion fatigue (180,000 cycles, 900 N). CAD/CAM lithium disilicate crowns also survived r ratio fatigue (1,000,000 cycles, 100 to 1,000 N). There appears to be a threshold for damage/bulk fracture for the lithium disilicate ceramic in the range of 1,100 to 1,200 N. Conclusion: Based on present fatigue findings, the application of CAD/CAM lithium disilicate ceramic in a monolithic/fully anatomical configuration resulted in fatigue-resistant crowns, whereas hand-layer-veneered zirconia crowns revealed a high susceptibility to mouth-motion cyclic loading with early veneer failures. Int J Prosthodont 2010; 23: 434-442.

Fatigue and damage accumulation of veneer porcelain pressed on Y-TZP

Objectives: This study compared the reliability and fracture patterns of zirconia cores veneered with pressable porcelain submitted to either axial or off-axis sliding contact fatigue. Methods: Forty-two Y-TZP plates (12 mm x 12 mm x 0.5 mm) veneered with pressable porcelain (12 mm x 12 mm x 1.2 mm) and adhesively luted to water aged composite resin blocks (12 mm x 12 mm x 4 mm) were stored in water at least 7 days prior to testing. Profiles for step-stress fatigue (ratio 3:2:1) were determined from single load to fracture tests (n = 3). Fatigue loading was delivered on specimen either on axial (n = 18) or off-axis 30 degrees angulation (n = 18) to simulate posterior tooth cusp inclination creating a 0.7 mm slide. Single load and fatigue tests utilized a 6.25 mm diameter WC indenter. Specimens were inspected by means of polarized-light microscope and SEM. Use level probability Weibull curves were plotted with 2-sided 90% confidence bounds (CB) and reliability for missions of 50,000 cycles at 200 N (90% CB) were calculated. Results: The calculated Weibull Beta was 3.34 and 2.47 for axial and off-axis groups, respectively, indicating that fatigue accelerated failure in both loading modes. The reliability data for a mission of 50,000 cycles at 200 N load with 90% CB indicates no difference between loading groups. Deep penetrating cone cracks reaching the core-veneer interface were observed in both groups. Partial cones due to the sliding component were observed along with the cone cracking for the off-axis group. No Y-TZP core fractures were observed. Conclusions: Reliability was not significantly different between axial and off-axis mouth-motion fatigued pressed over Y-TZP cores, but incorporation of sliding resulted in more aggressive damage on the veneer. (C) 2009 Elsevier Ltd. All rights reserved.

Causal and localizable quantum operations

We examine constraints on quantum operations imposed by relativistic causality. A bipartite superoperator is said to be localizable if it can be implemented by two parties (Alice and Bob) who share entanglement but do not communicate, it is causal if the superoperator does not convey information from Alice to Bob or from Bob to Alice. We characterize the general structure of causal complete-measurement superoperators, and exhibit examples that are causal but not localizable. We construct another class of causal bipartite superoperators that are not localizable by invoking bounds on the strength of correlations among the parts of a quantum system. A bipartite superoperator is said to be semilocalizable if it can be implemented with one-way quantum communication from Alice to Bob, and it is semicausal if it conveys no information from Bob to Alice. We show that all semicausal complete-measurement superoperators are semi localizable, and we establish a general criterion for semicausality. In the multipartite case, we observe that a measurement superoperator that projects onto the eigenspaces of a stabilizer code is localizable.

Lanczos subspace filter diagonalization: Homogeneous recursive filtering and a low-storage method for the calculation of matrix elements

We develop a new iterative filter diagonalization (FD) scheme based on Lanczos subspaces and demonstrate its application to the calculation of bound-state and resonance eigenvalues. The new scheme combines the Lanczos three-term vector recursion for the generation of a tridiagonal representation of the Hamiltonian with a three-term scalar recursion to generate filtered states within the Lanczos representation. Eigenstates in the energy windows of interest can then be obtained by solving a small generalized eigenvalue problem in the subspace spanned by the filtered states. The scalar filtering recursion is based on the homogeneous eigenvalue equation of the tridiagonal representation of the Hamiltonian, and is simpler and more efficient than our previous quasi-minimum-residual filter diagonalization (QMRFD) scheme (H. G. Yu and S. C. Smith, Chem. Phys. Lett., 1998, 283, 69), which was based on solving for the action of the Green operator via an inhomogeneous equation. A low-storage method for the construction of Hamiltonian and overlap matrix elements in the filtered-basis representation is devised, in which contributions to the matrix elements are computed simultaneously as the recursion proceeds, allowing coefficients of the filtered states to be discarded once their contribution has been evaluated. Application to the HO2 system shows that the new scheme is highly efficient and can generate eigenvalues with the same numerical accuracy as the basic Lanczos algorithm.

Brief note on the variation of constants formula for fuzzy differential equations

This note gives a theory of state transition matrices for linear systems of fuzzy differential equations. This is used to give a fuzzy version of the classical variation of constants formula. A simple example of a time-independent control system is used to illustrate the methods. While similar problems to the crisp case arise for time-dependent systems, in time-independent cases the calculations are elementary solutions of eigenvalue-eigenvector problems. In particular, for nonnegative or nonpositive matrices, the problems at each level set, can easily be solved in MATLAB to give the level sets of the fuzzy solution. (C) 2002 Elsevier Science B.V. All rights reserved.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

Computation of the linear elastic properties of random porous materials with a wide variety of microstructure

A finite-element method is used to study the elastic properties of random three-dimensional porous materials with highly interconnected pores. We show that Young's modulus, E, is practically independent of Poisson's ratio of the solid phase, nu(s), over the entire solid fraction range, and Poisson's ratio, nu, becomes independent of nu(s) as the percolation threshold is approached. We represent this behaviour of nu in a flow diagram. This interesting but approximate behaviour is very similar to the exactly known behaviour in two-dimensional porous materials. In addition, the behaviour of nu versus nu(s) appears to imply that information in the dilute porosity limit can affect behaviour in the percolation threshold limit. We summarize the finite-element results in terms of simple structure-property relations, instead of tables of data, to make it easier to apply the computational results. Without using accurate numerical computations, one is limited to various effective medium theories and rigorous approximations like bounds and expansions. The accuracy of these equations is unknown for general porous media. To verify a particular theory it is important to check that it predicts both isotropic elastic moduli, i.e. prediction of Young's modulus alone is necessary but not sufficient. The subtleties of Poisson's ratio behaviour actually provide a very effective method for showing differences between the theories and demonstrating their ranges of validity. We find that for moderate- to high-porosity materials, none of the analytical theories is accurate and, at present, numerical techniques must be relied upon.

Boundary value problems for systems of difference equations associated with systems of second-order ordinary differential equations

We study difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order ordinary differential equations. We formulate conditions which guarantee a priori bounds on first differences of solutions to the discretized problem. We establish existence results for solutions to the discretized boundary value problems subject to nonlinear boundary conditions. We apply our results to show that solutions to the discrete problem converge to solutions of the continuous problem in an aggregate sense. (C) 2002 Elsevier Science Ltd. All rights reserved.

Difference equations associated with fully nonlinear boundary value problems for second order ordinary differential equations

We study the continuous problem y"=f(x,y,y'), xc[0,1], 0=G((y(0),y(1)),(y'(0), y'(1))), and its discrete approximation (y(k+1)-2y(k)+y(k-1))/h(2) =f(t(k), y(k), v(k)), k = 1,..., n-1, 0 = G((y(0), y(n)), (v(1), v(n))), where f and G = (g(0), g(1)) are continuous and fully nonlinear, h = 1/n, v(k) = (y(k) - y(k-1))/h, for k =1,..., n, and t(k) = kh, for k = 0,...,n. We assume there exist strict lower and strict upper solutions and impose additional conditions on f and G which are known to yield a priori bounds on, and to guarantee the existence of solutions of the continuous problem. We show that the discrete approximation also has solutions which approximate solutions of the continuous problem and converge to the solution of the continuous problem when it is unique, as the grid size goes to 0. Homotopy methods can be used to compute the solution of the discrete approximation. Our results were motivated by those of Gaines.

The nonexistence of spurious solutions to discrete, two-point boundary value problems

We investigate difference equations which arise as discrete approximations to two-point boundary value problems for systems of second-order, ordinary differential equations. We formulate conditions under which all solutions to the discrete problem satisfy certain a priori bounds which axe independent of the step-size. As a result, the nonexistence of spurious solutions are guaranteed. Some existence and convergence theorems for solutions to the discrete problem are also presented. (C) 2002 Elsevier Science Ltd. All rights reserved.

Difference equations in Banach spaces

Difference equations which discretely approximate boundary value problems for second-order ordinary differential equations are analysed. It is well known that the existence of solutions to the continuous problem does not necessarily imply existence of solutions to the discrete problem and, even if solutions to the discrete problem are guaranteed, they may be unrelated and inapplicable to the continuous problem. Analogues to theorems for the continuous problem regarding a priori bounds and existence of solutions are formulated for the discrete problem. Solutions to the discrete problem are shown to converge to solutions of the continuous problem in an aggregate sense. An example which arises in the study of the finite deflections of an elastic string under a transverse load is investigated. The earlier results are applied to show the existence of a solution; the sufficient estimates on the step size are presented. (C) 2003 Elsevier Science Ltd. All rights reserved.