scientific article; zbMATH DE number 3731221
Bairstow's methodconstrained optimizationerror accumulationfeasible direction methodsFletcher, Powell and Davidon techniquesgradient techniquesiterative proceduresleast-squares data fittingpenalty function methodssensitivity analysissimplex algorithm
Mathematics for nonmathematicians (engineering, social sciences, etc.) (00A06) Numerical methods in optimal control (49Mxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Software, source code, etc. for problems pertaining to numerical analysis (65-04) Numerical smoothing, curve fitting (65D10) Numerical differentiation (65D25) Numerical quadrature and cubature formulas (65D32) Direct numerical methods for linear systems and matrix inversion (65F05) Roundoff error (65G50) Numerical computation of solutions to single equations (65H05) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Numerical methods for ordinary differential equations (65Lxx) Linear programming (90C05)
- Formal convergence characteristics of elliptically constrained incremental Newton-Raphson algorithms
- Methods of calculating \(l_ p\)-minimum norm solutions of consistent linear systems
- Numerical inversion of Mellin moments and Laplace transforms
- Molecular associations from ab initio pair potentials
- Relaxation times in a finite Ising system with random impurities
- Parameter optimization in the regularized Shannon's kernels of higher-order discrete singular convolutions
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 Q3918985)
