Publication:3996742
From MaRDI portal
zbMath0715.65027MaRDI QIDQ3996742
Publication date: 23 January 1993
computational complexity; estimation; computer program; numerical stability; iterative solutions; exercises; nonlinear least squares; linear least squares problems; catalogue of matrix methods
62J05: Linear regression; mixed models
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
65F10: Iterative numerical methods for linear systems
65F05: Direct numerical methods for linear systems and matrix inversion
65C99: Probabilistic methods, stochastic differential equations
Related Items
Doing Least Squares: Perspectives from Gauss and Yule, Another look at subset selection using linear least squares, The Kth TSP is pseudopolynomial when TSP is polynomial, SOLVING THE UPDATED AND DOWNDATED ORDINARY LINEAR MODEL ON MASSIVELY PARALLEL SIMD SYSTEMS, How ordinary elimination became Gaussian elimination, An inverse problem in estimating simultaneously the effective thermal conductivity and volumetric heat capacity of biological tissue, A direct method for the solution of sparse linear least squares problems, Changes in the general linear model: A unified approach, Numerics of Gram-Schmidt orthogonalization, A new operational matrix of Caputo fractional derivatives of Fermat polynomials: an application for solving the Bagley-Torvik equation, Finite difference approach for variable order reaction-subdiffusion equations, Some early statistical contributions to the theory and practice of linear algebra, Notes on the prehistory of principal components analysis, Joint source-channel coding via model predictive control, On privacy preserving data release of linear dynamic networks, Secure multi-party computation in large networks, A comparison of algorithms for forming the QR decomposition for use in regression, Inclusion and exclusion of data or parameters in the general linear model, Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks
