Alain Noullez 2026-11-05
Alain Noullez is a physicist whose documented work combines fluid and magnetohydrodynamic turbulence, statistical physics and numerical methods. His historical CV in an ISSI team proposal records research at the Observatoire de la Côte d'Azur, together with interests in statistics, signal processing and numerical analysis.[ref]
He coauthored the 2007 Ulysses spacecraft study of an energy cascade in the solar wind. The investigators formed mixed third-order structure function statistics from Elsässer variables, which combine velocity and magnetic field fluctuations. A roughly linear dependence on separation supplied evidence of transfer across scales. The analysis used high-speed polar-wind observations and explicitly related a time lag to a spatial separation through the assumption that the flow carries structures past the spacecraft.[ref]
This makes a useful distinction between an instrument's output and a physical conclusion. A spacecraft samples a time series at one moving location; interpreting the separation dependence requires a stated mapping from observation time to spatial structure. The statistical method and the physical assumption are both part of the result.
Brook Taylor Created 2026-10-13 Updated 2026-11-05
Brook Taylor was a mathematician whose 1715 work developed methods of finite differences and the expansion now called the Taylor series. He also studied vibrations of mechanical strings and mathematical perspective projection.[ref] A Taylor polynomial uses the derivatives of a function at one point to build a local polynomial approximation. For instance, near zero, . The remainder is essential: a finite approximation can have a controlled error without asserting that an infinite Taylor series converges to the function. This distinction makes the method useful in numerical analysis and local analysis of differential equations.
Figure 1.
Portrait of Brook Taylor
. Probably Louis Goupy, circa 1720; National Portrait Gallery, London, NPG 1920. Public domain (author died 1747; life-plus-100, pre-1931 U.S. publication) and faithful reproduction / PD-Art. Source and usage information on the linked Wikimedia file page. Source.
Carl Runge Created 2026-10-14 Updated 2026-11-05
A German mathematician whose work combined numerical analysis with spectroscopy. He studied numerical solution of equations and the measured wavelengths of elemental spectral lines, rather than treating mathematical computation as separate from experimental questions.
His name is attached to the Runge-Kutta method for approximating ordinary differential equations, alongside Martin Kutta. Such methods replace a continuous evolution by a succession of computed time steps. His work on spectral regularities similarly sought structure in numerical measurements. These two interests make him an example of the exchange between practical calculation and mathematical models of physical observations. [ref]
Charles George Broyden Created 2026-10-24 Updated 2026-10-31
A mathematician associated with Broyden's method and quasi-Newton methods in numerical analysis. An institutional portrait is catalogued by the University of Essex Library Services: www.flickr.com/photos/149590996@N07/31601668406/
Figure 1.
Charles George Broyden, portrait catalogued by University of Essex Library Services on Flickr
.
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/
C. T. Kelley Created 2026-10-14 Updated 2026-11-05
C. T. Kelley studies numerical analysis, including iterative methods for nonlinear equations, mathematical optimization and linear systems. His research connects solver design with numerical stability and computational cost, including methods that perform different stages at different arithmetic precisions.[ref]
David Bindel Created 2026-10-13 Updated 2026-11-05
Author of numerical analysis teaching notes, including power iteration. The notes connect an iterative eigenvector calculation with the spectral properties governing its convergence.[ref]
Discrete Fourier transform Created 2026-09-24 Updated 2026-10-18
The discrete Fourier transform turns a finite list of samples into the weights of its discrete Fourier modes. The goal is to reveal a simple oscillatory recipe hidden in complicated-looking data, while retaining enough information to reconstruct every sample exactly. In signal processing, those weights identify sampled frequencies and wave phases; in numerical analysis, they simplify circular convolution and the discrete sine transform Poisson solver.
Start with eight real samples, indexed by :
Writing , the actual list is
The discrete Fourier transform recovers the recipe as
The constant contributes ; the cosine contributes ; the half-sized sine contributes and . All other coefficients vanish exactly. The imaginary coefficients carry the sine's wave phase, which a plot of absolute values alone would hide.
Figure 1.
Eight samples become a constant, a cosine pair, and a sine pair in the discrete Fourier transform
. Details.
Precisely, for a positive integer and a vector , the forward discrete Fourier transform and inverse discrete Fourier transform used here are
Thus the forward exponent has a minus sign and no scale factor; the inverse exponent has a plus sign and the factor . The coefficients in the reconstruction are , rather than . In the example, , the pair reconstructs the cosine, and the pair reconstructs the half-sized sine. These conventions agree with the scaled Fourier coefficients in MIT's authored notes.[ref]
The proof idea is orthogonality of roots of unity: for integers ,
Distinct discrete Fourier modes cancel in this finite geometric series. Substituting the forward formula into the inverse discrete Fourier transform leaves only the desired sample. The same orthogonality makes the normalized discrete Fourier modes an orthonormal basis and gives the discrete Parseval identity, in the present convention,
For the eight-sample example, direct squaring gives , while , so . This identity preserves the squared L2 norm after accounting for normalization. The existing discrete Parseval identity instead scales the forward discrete Fourier transform by , producing a unitary matrix and equal squared L2 norms without the factor .
For real input, discrete Fourier conjugate symmetry pairs positive and negative frequencies. The label is a residue modulo : when represents the same discrete Fourier mode as , since . It therefore represents negative frequency cycles per sample. If samples are seconds apart, the corresponding signed frequency is cycles per second. Similarly, index represents , while index is its own negative modulo .
The discrete Fourier transform is an invertible map between two finite vectors. The continuous Fourier transform instead describes a function on the real line by an integral over a continuous frequency variable. A finite list of samples does not determine the full continuous frequency spectrum: aliasing of discrete Fourier modes already supplies distinct waveforms with identical observations. Applying the inverse formula at arbitrary integer indices gives the periodic extension of a finite sequence, repeating the recorded block every samples. This is a property of that representation, rather than evidence that the physical signal repeats beyond the recording. Laurent Demanet's MIT notes place the discrete Fourier transform alongside the continuous Fourier transform and Fourier series to explain the role of sampling and repetition.[ref]
The beauty is that a change of basis exposes cancellation and structure without losing data. Direct evaluation needs sums of terms; a Fast Fourier transform computes the same discrete Fourier transform with far less work. Computational speed and the mathematical meaning of the coefficients are separate questions.
Lloyd N. Trefethen 2026-11-05
Lloyd N. Trefethen is a mathematician working in numerical analysis. His author-maintained homepage records work at Oxford and a subsequent applied-mathematics appointment at Harvard. His book Spectral Methods in MATLAB by Lloyd N. Trefethen teaches spectral methods through short executable programs, connecting approximation accuracy with numerical solutions of differential equations.[ref][ref]
Figure 1.
Lloyd N. Trefethen
. Portrait credited to Sarah Bird on Lloyd N. Trefethen homepage.
An instructive theme is that an approximation's smoothness affects how efficiently its coefficients decay. A Fourier series representation of a smooth periodic function can be differentiated through its coefficients, but unresolved oscillations can still produce aliasing. High accuracy for one smooth test function does not establish that every sampled input is equally well represented.[ref]
For a concrete illustration, sampling on sufficiently many equally spaced points over a full period permits its trigonometric interpolant to reproduce the function exactly, and coefficient differentiation gives . With only four equally spaced points, the samples instead match ; differentiating that interpolant gives . The calculation illustrates the attraction of spectral methods and the need to state their resolution assumptions. It is an original example of the numerical questions made tangible by his computational exposition.
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]
Polynomial Created 2026-09-24 Updated 2026-10-18
A polynomial is a finite sum of monomials with coefficients in a ring. In one variable over a commutative ring , write
The symbol is an indeterminate: it records powers formally before we choose an input value. Finite expressions are easy to add, multiply, evaluate, and differentiate, making polynomials a common language for exact algebra and approximate numerical analysis.
Consider the real polynomial
The expanded form displays the coefficients and the degree of a polynomial; the factored form displays its roots of a polynomial. At , either description gives . At and , the factored form makes the zero values immediate. Keeping several descriptions of one object is useful because each makes a different question easy.
Figure 1.
A simple polynomial root crosses the axis, while a double root touches it; perturbing the double factor can produce real or complex roots
. Details.
The graph shows another connection. The factor changes sign across , while stays nonnegative across . Thus the graph crosses the axis at the simple root of a polynomial and touches it at the double root. Multiplicity of a root turns an algebraic repetition into visible local behavior.
For calculations, Horner's method evaluates a polynomial through nested multiplication. For modeling, a Taylor polynomial describes local behavior near a point, while polynomial interpolation constructs a polynomial matching prescribed data. Their usefulness comes with assumptions: a local approximation and an exact identity are different claims, and changing the coefficient ring can change which polynomial roots exist.
Richard J. Braun Created 2026-10-13 Updated 2026-11-05
Coauthor with Tobin A. Driscoll of a textbook in numerical analysis. Its examples connect numerical algorithms with error estimates, problem conditioning and stability.[ref]
Significant figures Created 2026-10-18 Updated 2026-10-20
In numerical analysis, significant figures record how many meaningful digits are retained in a written numerical value. Leading zeros locate the decimal point rather than adding precision: and each have two significant figures. Trailing zeros may require an explicit convention to distinguish measured precision from positional notation.
Steffen Rohde 2026-11-05
With Oded Schramm, he established basic geometric properties of Schramm–Loewner evolution, in which a Brownian motion drives a conformal growth equation. Their paper proves a change in path behavior with the parameter: simple curves for , self-intersections for , and space-filling paths for . These regimes connect an analytic differential equation with the geometry of random interfaces.[ref]
Figure 1.
Steffen Rohde
. Portrait identified by the University of Washington mathematics profile. Source.
Tobin A. Driscoll Created 2026-10-13 Updated 2026-11-05
Coauthor with Richard J. Braun of a textbook in numerical analysis. It develops computational methods together with conditioning, approximation error and stability, so an algorithm is judged by the reliability of its result as well as its speed.[ref]
Yannis G. Kevrekidis Created 2026-10-14 Updated 2026-11-05
Yannis G. Kevrekidis is a chemical engineer whose research connects dynamical systems, multiscale modeling and machine learning. His institutional research description emphasizes how interactions at small scales produce larger-scale patterns, instabilities and dynamics in physical, chemical and biological systems.[ref]
With collaborators he developed equation-free modeling, in which detailed simulations are used to investigate coarse-scale behaviour even when a closed equation for the coarse variables is unavailable. The motivating distinction is between possessing a simulator of microscopic dynamics and possessing a compact equation for a few large-scale observables. This places numerical analysis, the choice of state variables and the extraction of useful descriptions at the centre of multiscale modeling.[ref]
Figure 1. . Portrait identified on the Johns Hopkins University profile.
Zdzislaw Jackiewicz 2026-11-05
Zdzislaw Jackiewicz is a mathematician working in numerical analysis whose work includes methods for ordinary differential equations, delay differential equations and Volterra integral equations. His authored account of general linear methods describes a framework combining internal stage evaluations with a vector of information passed between successive time steps.[ref]
For , a Runge-Kutta method passes an approximation to between steps while computing several intermediate stages. A linear multistep method instead retains values from several earlier times. General linear methods put both patterns in one matrix formulation, allowing accuracy and numerical stability to be designed together. His Arizona State University profile identifies this subject and the construction of implicit-explicit methods as research interests.[ref]
Figure 1.
Zdzislaw Jackiewicz, identified by Arizona State University
.