Peter Lancaster
University of Calgary
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Peter Lancaster.
Mathematics of Computation | 1981
Peter Lancaster; K. Šalkauskas
An analysis of moving least squares (m.l.s.) methods for smoothing and interpolating scattered data is presented. In particular, theorems are proved concerning the smoothness of interpolants and the description of m.l.s. processes as projection methods. Some properties of compositions of the m.l.s. projector, with projectors associated with finiteelement schemes, are also considered. The analysis is accompanied by examples of univariate and bivariate problems.
Mathematics of Computation | 1999
Chun-Hua Guo; Peter Lancaster
We study iterative methods for finding the maximal Hermitian positive definite solutions of the matrix equations X + A * X -1 A = Q and X - A * X -1 A = Q, where Q is Hermitian positive definite. General convergence results are given for the basic fixed point iteration for both equations. Newtons method and inversion free variants of the basic fixed point iteration are discussed in some detail for the first equation. Numerical results are reported to illustrate the convergence behaviour of various algorithms.
International Journal of Control | 1980
Peter Lancaster; Leiba Rodman
Abstract Necessary and sufficient conditions for existence and uniqueness of hermitian solutions of the algebraic n×n matrix Riccati equation (D≥0,C∗=C,(A, D) controllable) are obtained. The conditions are formulated in terms of the spectral structure of a certain 2n × 2n matrix. A description is also given of the set of solutions in a geometrical language of invariant subspaces which are neutral with respect to a certain indefinite scalar product. This technique is then applied to provide some results on existence and uniqueness of solutions which are not necessarily hermitian. The problem is also approached (when Dz;> 0)via a related unilateral equation. for Z where K1 ∗ equals K1, K0 ∗ equals K0
SIAM Journal on Matrix Analysis and Applications | 1993
Alan L. Andrew; K.W.Eric Chu; Peter Lancaster
For an
Linear Algebra and its Applications | 1996
Dai Hua; Peter Lancaster
n \times n
Siam Review | 2005
Peter Lancaster; Leiba Rodman
matrix-valued function
Linear Algebra and its Applications | 1978
Israel Gohberg; Peter Lancaster; Leiba Rodman
L( {\boldsymbol \rho} ,\lambda )
Communications of The ACM | 1971
Jon G. Rokne; Peter Lancaster
, where
Linear Algebra and its Applications | 1984
Peter Lancaster; L. Lerer; M. Tismenetsky
{\boldsymbol \rho}
Linear Algebra and its Applications | 1987
Israel Gohberg; I. Koltracht; Peter Lancaster
is a vector of independent parameters and