Applied Linear & Special Functions

← Back to Domain-Specific Families

Abstractions connecting special functions, matrix algorithms, convex analysis, quadratic structures, and numerical or analytic transformations used in applied mathematics.

18 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

• Bessel Function — A parameterized special-function family solving Bessel's equation and furnishing radial modes for cylindrical separation problems.
• Blaschke Product — A finite or convergent infinite product of disk-automorphism factors that realizes prescribed zeros while forming an inner analytic function.
• Box–Muller Transform — Convert two independent uniform variates into two independent standard-normal variates by assigning an exponential radial law and a uniform angle, then projecting the resulting point onto Cartesian axes.
• Carlyle Circle — A coefficient-defined circle whose intersections with the horizontal axis geometrically realize the real roots of a normalized quadratic equation.
• Compact Operator — A bounded linear operator that sends bounded sets to relatively compact sets, giving infinite-dimensional problems finite-dimensional-like approximation and spectral behavior.
• Conjugate Gradient Method — A Krylov-subspace solver for symmetric positive-definite linear systems that builds mutually A-conjugate directions while minimizing the associated quadratic.
• Dirichlet Kernel — The finite symmetric Fourier-mode selector whose periodic convolution produces an ordinary Fourier partial sum.
• Exponential Integrator — A time-integration method that propagates a selected linear part through its exponential and approximates the remaining variation-of-constants contribution.
• Matrix Similarity — Treat square matrices A and B over the same field as equivalent exactly when B = P⁻¹AP for an invertible P, so they represent one linear operator in different bases.
• Proper Convex Function — An extended-real convex function whose effective domain is nonempty and which nowhere takes negative infinity, excluding the two degenerate functions that break convex-analytic operations.
• Pseudo-Euclidean Space — A finite-dimensional real vector or affine space equipped with a nondegenerate symmetric bilinear form of mixed signature, admitting positive, negative, and nonzero null directions.
• QR Algorithm — An eigenvalue iteration that repeatedly QR-factorizes a shifted matrix and reverses the factors, preserving similarity while driving it toward real or complex Schur form for deflation.
• Quadratic Equation — A one-variable degree-two polynomial equality whose coefficient triple, discriminant, and root formulas provide a complete solution classification over a declared scalar domain.
• Quadratic Space — A vector space equipped with a quadratic form, carrying isotropy, radical, orthogonality, and equivalence structure that depends essentially on the base field.
• Riemann–Hilbert Problem — A complex-analytic boundary-value problem that reconstructs a piecewise holomorphic scalar or matrix function from prescribed multiplicative jumps across an oriented contour, together with normalization and singularity conditions.
• Roothaan–Hall Equations — Express finite-basis Hartree–Fock stationarity as a nonlinear generalized eigenproblem FC = SCε whose Fock matrix must be rebuilt self-consistently from the occupied-orbital coefficients.
• Siegel Zero — Treat a possible real simple zero of a primitive real Dirichlet L-function exceptionally close to s=1 as the sole allowed intruder in a stated classical zero-free region, with family uniqueness, ineffectivity, and zero-repulsion consequences kept explicit.
• Tensor Sketch — A randomized linear embedding for tensor-product features that combines factorwise CountSketches by convolution, approximating inner products or norms without materializing the full Kronecker vector.