scientific article; zbMATH DE number 1090880
approximationArnoldi decompositionsbest approximationblock diagonalizationChebyshev approximationconjugate gradient methodseigensystemsHessenberg QR algorithmHouseholder transformationJordan canonical formKrylov sequence methodsLanczos algorithmleast squares approximationNewton methodorthogonal triangularizationpower methodQR factorizationRayleigh quotientSchur decompositionsplinestextbook
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to approximations and expansions (41-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Numerical computation using splines (65D07) Algorithms for approximation of functions (65D15) Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of solutions to systems of equations (65H10)
Like the other volume ``Afternotes on numerical analysis by the same author (1996; Zbl 0844.65002), this new volume is the result of writing down these notes immediately after each lecture was given. Here the topics treated are not elementary and require a deeper mathematical understanding. This well-written book is an ideal source for graduate courses on advanced numerical analysis or seminars selecting the corresponding material. The contents of the volume cover some topics of classical and modern numerical analysis. The first part, based on 9 lectures, deals with approximation including the approximation in normed linear spaces, existence and uniqueness of best approximation in the space \(C[0,1]\), Chebyshev approximation, discrete, continuous and weighted least squares approximation and the QR factorization, Householder transformation and orthogonal triangularization. A second short part consists of 2 lectures on linear and cubic splines and is followed by a third part of 7 lectures devoted to the eigensystems and containing the standard techniques of matrix computations, the Schur decomposition, the block diagonalization, Jordan canonical form, the Rayleigh quotient and the power method, the QR algorithm and the Hessenberg QR algorithm. The fourth part consisting of 6 lectures on Krylov sequence methods is devoted to Arnoldi decompositions, the Lanczos algorithm and the conjugate gradient methods. A fifth part consists of 2 lectures concerning with some classical linear and nonlinear iterations and a multivariate version of the Newton method.
- Hyman's method revisited
- Nonlinear least-squares spline fitting with variable knots
- An adapted integration method for Volterra integral equation of the second kind with weakly singular kernel
- Reduced order model approach to inverse scattering
- Krylov subspaces and the analytic grade
- An extended QR-solver for large profiled matrices
- A condition-based algorithm for solving polyhedral feasibility problems
- Spectral approximation of convolution operators
- A fast and spectrally convergent algorithm for rational-order fractional integral and differential equations
- Continuous analogues of Krylov subspace methods for differential operators
- Pseudozeros of multivariate polynomials
- High-order Langevin diffusion yields an accelerated MCMC algorithm
- Least-Squares Spectral Methods for ODE Eigenvalue Problems
- Semi-Infinite Linear Regression and Its Applications
- Chebfun in Three Dimensions
- Numerical geometric acoustics: an eikonal-based approach for modeling sound propagation in 3D environments
- The Reconstruction Approach: From Interpolation to Regression
- Discrete perturbation estimates for eigenpairs of Fredholm operator-valued functions
- Automatic spectral collocation for integral, integro-differential, and integrally reformulated differential equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366793)