Preface 1. Background in linear algebra 2. Discretization of partial differential equations 3. Sparse matrices 4. Basic iterative methods 5. Projection methods 6. Krylov subspace methods Part I 7. Krylov subspace methods Part II 8. Methods related to the normal equations 9. Preconditioned iterations 10. Preconditioning techniques 11. Parallel implementations 12. Parallel preconditioners 13. Multigrid methods 14. Domain decomposition methods Bibliography Index.

/pdf/iterative-methods-for-sparse-linear-systems-34ozhpwq89.pdf

Iterative Methods for Sparse Linear Systems

The fundamental theorems on the asymptotic behavior of eigenvalues, inverses, and products of banded Toeplitz matrices and Toeplitz matrices with absolutely summable elements are derived in a tutorial manner. Mathematical elegance and generality are sacrificed for conceptual simplicity and insight in the hope of making these results available to engineers lacking either the background or endurance to attack the mathematical literature on the subject. By limiting the generality of the matrices considered, the essential ideas and results can be conveyed in a more intuitive manner without the mathematical machinery required for the most general cases. As an application the results are applied to the study of the covariance matrices and their factors of linear models of discrete time random processes.

/pdf/toeplitz-and-circulant-matrices-3e6lj1a9jc.pdf

Toeplitz and circulant matrices

http://galton.uchicago.edu/~lekheng/courses/310w11/boyd-socp.pdf

Applications of second-order cone programming

The wavelet transform is compared with the more classical short-time Fourier transform approach to signal analysis. Then the relations between wavelets, filter banks, and multiresolution signal processing are explored. A brief review is given of perfect reconstruction filter banks, which can be used both for computing the discrete wavelet transform, and for deriving continuous wavelet bases, provided that the filters meet a constraint known as regularity. Given a low-pass filter, necessary and sufficient conditions for the existence of a complementary high-pass filter that will permit perfect reconstruction are derived. The perfect reconstruction condition is posed as a Bezout identity, and it is shown how it is possible to find all higher-degree complementary filters based on an analogy with the theory of Diophantine equations. An alternative approach based on the theory of continued fractions is also given. These results are used to design highly regular filter banks, which generate biorthogonal continuous wavelet bases with symmetries. >

/pdf/wavelets-and-filter-banks-theory-and-design-3jyllnwyku.pdf

Wavelets and filter banks: theory and design

https://hal.inria.fr/inria-00541855/document

Wavelets on graphs via spectral graph theory

Introduction: 1 Examples and prospectus 2 Metric spaces 3 Normed linear spaces 4 Inner-product spaces 5 Convexity 6 Existence and unicity of best approximations 7 Convex functions The Tchebycheff Solution of Inconsistent Linear Equations: 1 Introduction 2 Systems of equations with one unknown 3 Characterization of the solution 4 The special case 5 Polya's algorithm 6 The ascent algorithm 7 The descent algorithm 8 Convex programming Tchebycheff Approximation by Polynomials and Other Linear Families: 1 Introduction 2 Interpolation 3 The Weierstrass theorem 4 General linear families 5 the unicity problem 6 Discretization errors: General theory 7 Discretization: Algebraic polynomials. The inequalities of Markoff and Bernstein 8 Algorithms Least-squares Approximation and Related Topics: 1 Introduction 2 Orthogonal systems of polynomials 3 Convergence of orthogonal expansions 4 Approximation by series of Tchebycheff polynomials 5 Discrete least-squares approximation 6 The Jackson theorems Rational Approximation: 1 Introduction 2 Existence of best rational approximations 3 The characterization of best approximations 4 Unicity Continuity of best-approximation operators 5 Algorithms 6 Pade Approximation and its generalizations 7 Continued fractions Some Additional Topics: 1 The Stone approximation theorem 2 The Muntz theorem 3 The converses of the Jackson theorems 4 Polygonal approximation and bases in $C[a, b]$ 5 The Kharshiladze-Lozinski theorems 6 Approximation in the mean Notes References Index.

Introduction to approximation theory

An introduction to tensor product spaces.- Proximinality.- The alternating algorithm.- Central proximity maps.- The diliberto-straus algorithm in C(S x T).- The algorithm of von golitschek.- The L 1-version of the diliberto-straus algorithm.- Estimates of projection constants.- Minimal projections.- Appendix on the bochner integral.- Appendix on miscellaneous results in banach spaces.

Approximation Theory in Tensor Product Spaces

Normed Linear Spaces * Hilbert Spaces * Calculus in Banach Spaces * Approximate Methods of Analysis * Distributions * The Fourier Transform * Additional Topics * Measure and Integration * References * Index

https://www.springer.com/cda/content/document/productFlyer/productFlyer_978-0-387-95279-6.pdf?SGWID=0-0-1297-2189612-0

Analysis for Applied Mathematics

/pdf/the-existence-and-unicity-of-best-approximations-3ezqjycr8u.pdf

Elliott Ward Cheney

Papers

Introduction to approximation theory

Approximation Theory in Tensor Product Spaces

Analysis for Applied Mathematics

The Existence and Unicity of Best Approximations.

Approximation Theory Vii