Claude Brezinski Created 2026-10-18 Updated 2026-11-05
Claude Brezinski works in numerical analysis, particularly extrapolation, Padé approximation, continued fractions, orthogonal polynomials and numerical linear algebra. His research also treats systems of nonlinear equations. These subjects connect different representations of an approximation with ways to accelerate or stabilize a numerical computation.[ref]
Identity source: claude-brezinski.fr/
Portrait of Claude Brezinski
. Continuous linear operator Created 2026-10-14 Updated 2026-11-05
A continuous linear operator is a linear map that is continuous for the topologies of its domain and codomain. Between normed vector spaces, continuity is equivalent to an operator bound for some finite , so the terms bounded linear operator and continuous linear operator coincide there.
For general topological vector spaces, sending every bounded set in a topological vector space to a bounded set is a weaker property. For example, the identity from the weak topology on an infinite-dimensional Hilbert space to its norm topology maps bounded sets to bounded sets by the Uniform boundedness principle, but is not continuous. A basic weak zero neighbourhood only restricts finitely many linear functionals, leaving a nonzero common-kernel direction with arbitrarily large norm.
Thus the operator norm interpretation of boundedness used throughout numerical linear algebra belongs to the normed-space setting. In other vector topologies, specify continuity explicitly.
Ilse Ipsen Created 2026-10-14 Updated 2026-11-05
Ilse Ipsen works in numerical linear algebra, randomized algorithms, the theory of matrices and scientific computing. Her research also connects numerical methods with nonlinear problems, parameter estimation and statistics. These topics concern both efficient computation and how approximation errors or perturbations affect the reliability of a calculated result.[ref]
Portrait of Ilse Ipsen
. Portrait identified on the NC State University profile. Iterative method 2026-10-14
An iterative method approximates a solution by repeatedly updating an initial guess. In numerical linear algebra, a stationary iterative method for a linear system uses a fixed iteration map; other iterations can change their update rule or search space at each step.
Normal equations for linear least squares 2026-10-14
Minimizing gives the displayed equations by differentiation. Equivalently, the regression residual satisfies : it is orthogonal to every column of the design matrix. If has full column rank, the minimizer is unique and the fitted values are the orthogonal projection of onto its column space. A rank-deficient design matrix can give multiple coefficient vectors, while the projected fitted vector is still unique.
For an intercept and one predictor, put and . The equations give and , provided . In the five-point example in linear regression, , , and , giving and .
The normal equations describe the mathematical optimum, but explicitly forming and inverting can amplify numerical problems. A QR decomposition computes the same least-squares solution through orthogonal coordinates; a singular value decomposition also exposes nearly dependent columns. This connects statistical fitting to numerical linear algebra and the choice of a stable algorithm. [ref]
https://ocw.mit.edu/courses/18-06sc-linear-algebra-fall-2011/. MIT 18.06SC, Projections onto Subspaces and Least Squares
Numerical linear algebra Created 2026-09-24 Updated 2026-11-05
Numerical linear algebra develops algorithms for linear systems, least squares, eigenvalue problems and other matrix computations, with attention to roundoff error, cost and storage. A mathematically equivalent formula can behave very differently in floating-point arithmetic: solving through an LU decomposition avoids forming an explicit matrix inverse, while a QR decomposition gives an orthogonal route to least squares.
The central distinction is between accuracy of the computed answer and accuracy of the problem it solves. For , an approximate vector has linear-system residual . A small linear-system residual need not imply a small forward error when the condition number is large. For the exact examplethe solution is , whereas has Euclidean norm residual but Euclidean norm error . Here the condition number in the spectral norm is . The lost component barely changes the equations because its coefficient is tiny.
Direct linear solvers such as Gaussian elimination factor a matrix; iterative methods such as conjugate gradient successively improve a vector. For a large sparse matrix, fill-in and matrix preconditioning can matter as much as arithmetic count. The task is to preserve the structure that makes a computation accurate and affordable.
Solutions to all three questions of the University of Oxford numerical linear algebra paper, sat on 2 June 2025. Source: released examination PDF, parent PDF pages 1–3. The question statements are omitted. The Gaussian-matrix estimates in parts 2(b)(v) and 3(b)(iv) are used as the paper explicitly permits; their limitations are explained in those solutions.
Philip E. Gill Created 2026-10-31 Updated 2026-11-05
Philip E. Gill works on numerical analysis, numerical linear algebra and scientific computation. With Elizabeth Wong, he authored Sequential Quadratic Programming Methods by Philip E. Gill and Elizabeth Wong, explaining how constrained nonlinear problems can be approached through successive quadratic models.
The connection with linear algebra is computationally important: solving the local constrained systems is part of making an optimization method reliable.[ref]

