An implementation of the look-ahead Lanczos algorithm for non-Hermitian matrices

The nonsymmetric Lanczos method can be used to compute eigenvalues of large sparse non-Hermitian matrices or to solve large sparse non-Hermitian linear systems. However, the original Lanczos algorithm is susceptible to possible breakdowns and potential instabilities. An implementation is presented of a look-ahead version of the Lanczos algorithm that, except for the very special situation of an incurable breakdown, overcomes these problems by skipping over those steps in which a breakdown or near-breakdown would occur in the standard process. The proposed algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products as the standard Lanczos process without look-ahead

The Polynomial Carathéodory—Fejér Approximation Method for Jordan Regions

We propose a method for the approximation of analytic functions on Jordan regions that is based on a Carathéodory—Fejér type of economization of the Faber series. The method turns out to be very effective if the boundary of the region is analytic. It often still works when the region degenerates to a Jordan arc. We also derive related lower and upper bounds for the error of the best approximatio

The Carathéodory—Fejér Extension of a Finite Geometric Series

It is shown that the Caratheodory—Fejer extension of a finite geometric series can be given explicitly up to a simple polynomial equation in an auxiliary variable. This result allows us to analyse the Caratheodory-Fejer approximation method in the case where the quotients of successive Maclaurin coefficients of the given function tend to a limi

Conformal Mapping on Rough Boundaries II: Applications to bi-harmonic problems

We use a conformal mapping method introduced in a companion paper to study the properties of bi-harmonic fields in the vicinity of rough boundaries. We focus our analysis on two different situations where such bi-harmonic problems are encountered: a Stokes flow near a rough wall and the stress distribution on the rough interface of a material in uni-axial tension. We perform a complete numerical solution of these two-dimensional problems for any univalued rough surfaces. We present results for sinusoidal and self-affine surface whose slope can locally reach 2.5. Beyond the numerical solution we present perturbative solutions of these problems. We show in particular that at first order in roughness amplitude, the surface stress of a material in uni-axial tension can be directly obtained from the Hilbert transform of the local slope. In case of self-affine surfaces, we show that the stress distribution presents, for large stresses, a power law tail whose exponent continuously depends on the roughness amplitude

Photonic Clusters

We show through rigorous calculations that dielectric microspheres can be organized by an incident electromagnetic plane wave into stable cluster configurations, which we call photonic molecules. The long-range optical binding force arises from multiple scattering between the spheres. A photonic molecule can exhibit a multiplicity of distinct geometries, including quasicrystal-like configurations, with exotic dynamics. Linear stability analysis and dynamical simulations show that the equilibrium configurations can correspond with either stable or a type of quasi-stable states exhibiting periodic particle motion in the presence of frictional dissipation.Comment: 4 pages, 3 figure

Conformal Mapping on Rough Boundaries I: Applications to harmonic problems

The aim of this study is to analyze the properties of harmonic fields in the vicinity of rough boundaries where either a constant potential or a zero flux is imposed, while a constant field is prescribed at an infinite distance from this boundary. We introduce a conformal mapping technique that is tailored to this problem in two dimensions. An efficient algorithm is introduced to compute the conformal map for arbitrarily chosen boundaries. Harmonic fields can then simply be read from the conformal map. We discuss applications to "equivalent" smooth interfaces. We study the correlations between the topography and the field at the surface. Finally we apply the conformal map to the computation of inhomogeneous harmonic fields such as the derivation of Green function for localized flux on the surface of a rough boundary

Order reduction approaches for the algebraic Riccati equation and the LQR problem

We explore order reduction techniques for solving the algebraic Riccati equation (ARE), and investigating the numerical solution of the linear-quadratic regulator problem (LQR). A classical approach is to build a surrogate low dimensional model of the dynamical system, for instance by means of balanced truncation, and then solve the corresponding ARE. Alternatively, iterative methods can be used to directly solve the ARE and use its approximate solution to estimate quantities associated with the LQR. We propose a class of Petrov-Galerkin strategies that simultaneously reduce the dynamical system while approximately solving the ARE by projection. This methodology significantly generalizes a recently developed Galerkin method by using a pair of projection spaces, as it is often done in model order reduction of dynamical systems. Numerical experiments illustrate the advantages of the new class of methods over classical approaches when dealing with large matrices

The translation, validity and reliability of the German version of the Fremantle Back Awareness Questionnaire

Background: The Fremantle Back Awareness Questionnaire (FreBAQ) claims to assess disrupted self-perception of the back. The aim of this study was to develop a German version of the Fre-BAQ (FreBAQ-G) and assess its test-retest reliability, its known-groups validity and its convergent validity with another purported measure of back perception. Methods: The FreBaQ-G was translated following international guidelines for the transcultural adaptation of questionnaires. Thirty-five patients with non-specific CLBP and 48 healthy participants were recruited. Assessor one administered the FreBAQ-G to each patient with CLBP on two separate days to quantify intra-observer reliability. Assessor two administered the FreBaQ-G to each patient on day 1. The scores were compared to those obtained by assessor one on day 1 to assess inter-observer reliability. Known-groups validity was quantified by comparing the FreBAQ-G score between patients and healthy controls. To assess convergent validity, patient\u27s FreBAQ-G scores were correlated to their two-point discrimination (TPD) scores. Results: Intra- and Inter-observer reliability were both moderate with ICC3.1 = 0.88 (95%CI: 0.77 to 0.94) and 0.89 (95%CI: 0.79 to 0.94), respectively. Intra- and inter-observer limits of agreement (LoA) were 6.2 (95%CI: 5.0±8.1) and 6.0 (4.8±7.8), respectively. The adjusted mean difference between patients and controls was 5.4 (95%CI: 3.0 to 7.8, p\u3c0.01). Patient\u27s FreBAQ-G scores were not associated with TPD thresholds (Pearson\u27s r = -0.05, p = 0.79). Conclusions: The FreBAQ-G demonstrated a degree of reliability and known-groups validity. Interpretation of patient level data should be performed with caution because the LoA were substantial. It did not demonstrate convergent validity against TPD. Floor effects of some items of the FreBAQ-G may have influenced the validity and reliability results. The clinimetric properties of the FreBAQ-G require further investigation as a simple measure of disrupted self-perception of the back before firm recommendations on its use can be made

A bootstrap method for sum-of-poles approximations

A bootstrap method is presented for finding efficient sum-of-poles approximations of causal functions. The method is based on a recursive application of the nonlinear least squares optimization scheme developed in (Alpert et al. in SIAM J. Numer. Anal. 37:1138–1164, 2000), followed by the balanced truncation method for model reduction in computational control theory as a final optimization step. The method is expected to be useful for a fairly large class of causal functions encountered in engineering and applied physics. The performance of the method and its application to computational physics are illustrated via several numerical examples

A weakly stable algorithm for general Toeplitz systems

We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that R^T.R is close to A^T.A. Thus, when the algorithm is used to solve the semi-normal equations R^T.Rx = A^Tb, we obtain a weakly stable method for the solution of a nonsingular Toeplitz or Hankel linear system Ax = b. The algorithm also applies to the solution of the full-rank Toeplitz or Hankel least squares problem.Comment: 17 pages. An old Technical Report with postscript added. For further details, see http://wwwmaths.anu.edu.au/~brent/pub/pub143.htm