The following pages link to (Q4342463):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- A Krylov subspace generalization of the improved Wilkinson's algorithm for ill-conditioned linear systems (Q260135) (← links)
- On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously (Q262691) (← links)
- Computation of the monodromy matrix in floating point arithmetic with the Wilkinson model (Q316618) (← links)
- A computable criterion for the existence of connecting orbits in autonomous dynamics (Q330541) (← links)
- A note on matrices with maximal growth factor for Neville elimination (Q415213) (← links)
- Increasing data locality and introducing level-3 BLAS in the neville elimination (Q426354) (← links)
- Study on effective condition number for collocation methods (Q443338) (← links)
- Seepage analysis in multi-domain general anisotropic media by three-dimensional boundary elements (Q463640) (← links)
- A note on the Davison-Man method for Sylvester matrix equations (Q520305) (← links)
- Covariance regularity and \(\mathcal {H}\)-matrix approximation for rough random fields (Q522237) (← links)
- Extended Neyman smooth goodness-of-fit tests, applied to competing heavy-tailed distributions (Q528145) (← links)
- Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
- Robust stability analysis for discrete-time LQG system under finite wordlength effects, noise uncertainties and time-varying structured parameter perturbations (Q596304) (← links)
- Running error for the evaluation of rational Bézier surfaces through a robust algorithm (Q629401) (← links)
- Iterative refinement of the singular-value decomposition solution to the regression equations (Q671660) (← links)
- On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
- On the guaranteed convergence of new two-point root-finding methods for polynomial zeros (Q742856) (← links)
- Block splitting for distributed optimization (Q744220) (← links)
- Schröder-like algorithms for multiple complex zeros of a polynomial (Q756374) (← links)
- Forward error analysis of Gaussian elimination. I: Error and residual estimates (Q760168) (← links)
- Forward error analysis of Gaussian elimination. II: Stability theorems (Q760169) (← links)
- An interval algorithm for solving systems of linear equations to prespecified accuracy (Q760758) (← links)
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers (Q779625) (← links)
- Numerical decomposition of a convex function (Q799479) (← links)
- On the numerical computation of orbits of dynamical systems: The one- dimensional case (Q805837) (← links)
- Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form (Q818856) (← links)
- Nodally exact Ritz discretizations of 1D diffusion-absorption and Helmholtz equations by variational FIC and modified equation methods (Q835455) (← links)
- Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form (Q860688) (← links)
- \(\mathcal H\)-matrix accelerated second moment analysis for potentials with rough correlation (Q898437) (← links)
- Stability of a Runge-Kutta method for the Navier-Stokes equation (Q911927) (← links)
- Asymptotic behaviour of Karmarkar's method for linear programming (Q911987) (← links)
- Applied computational geometry: Towards robust solutions of basic problems (Q915501) (← links)
- Approximate iterations for structured matrices (Q929359) (← links)
- A quantitative probabilistic investigation into the accumulation of rounding errors in numerical ODE solution (Q971612) (← links)
- A posteriori componentwise error estimate for a computed solution of a system of linear equations (Q1054436) (← links)
- The coordinex problem and its relation to the conjecture of Wilkinson (Q1056193) (← links)
- The focal point method for solving systems of linear equations (Q1060531) (← links)
- Probabilistic error analysis of Gaussian elimination in floating point and logarithmic arithmetic (Q1064738) (← links)
- On a second order method for the simultaneous inclusion of polynomial complex zeros in rectangular arithmetic (Q1068519) (← links)
- Strict optimal a posteriori error and residual bounds for Gaussian elimination in floating-point arithmetic (Q1074299) (← links)
- The accurate solution of certain continuous problems using only single precision arithmetic (Q1091751) (← links)
- The equivalence of decimation in time and decimation in frequency in FFT computations (Q1107953) (← links)
- Sinc-type approximations in \(H^ 1\)-norm with applications to boundary value problems (Q1124293) (← links)
- Algorithms for roundoff error analysis - a relative error approach (Q1132500) (← links)
- On a test of programs for numerical zeros of polynomials (Q1132504) (← links)
- Round-off error analysis of iterations for large linear systems (Q1135609) (← links)
- Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge (Q1135614) (← links)
- Roundoff-error analysis of a new class of conjugate-gradient algorithms (Q1138343) (← links)
- Families of algebraic test equations (Q1143751) (← links)
