Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
From MaRDI portal
Publication:4271094
DOI10.1137/0914063zbMath0785.65015OpenAlexW2046332585MaRDI QIDQ4271094
Publication date: 14 April 1994
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc1275260/
Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, A new interior-point approach for large separable convex quadratic two-stage stochastic problems, Asymptotic properties of multivariate tapering for estimation and prediction, Sampling Strategies for Fast Updating of Gaussian Markov Random Fields, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, Primal-dual nonlinear rescaling method for convex optimization, Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking, An interior-point approach for primal block-angular problems, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Prim-based support-graph preconditioners for min-cost flow problems, An efficient analyse phase for element problems, IPM based sparse LP solver on a heterogeneous processor, A polynomial arc-search interior-point algorithm for linear programming, Sparse matrix tools for Gaussian models on lattices, Application ofh-adaptation for environmental fluid flow and species transport, On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems, A fast algorithm for sparse matrix computations related to inversion, On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach, GPU-accelerated iterative solutions for finite element analysis of soil-structure interaction problems, Generalized bootstrap method for assessment of uncertainty in semivariogram inference, Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems, Quadratic regularizations in an interior-point method for primal block-angular problems, Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors, A sparse proximal implementation of the LP dual active set algorithm, Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming, A primal-dual regularized interior-point method for convex quadratic programs, A survey of direct methods for sparse linear systems, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Optimal combination forecasts for hierarchical time series, Combinatorial Aspects in Sparse Elimination Methods, A Frisch-Newton algorithm for sparse quantile regression, Computational experience with a modified potential reduction algorithm for linear programming, PENNON: Software for Linear and Nonlinear Matrix Inequalities, Hypermatrix oriented supernode amalgamation, Interior-point solver for convex separable block-angular problems, Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension, High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods, The impact of high-performance computing in the solution of linear systems: Trends and problems, PCx: an interior-point code for linear programming, Most Likely Separation of Intensity and Warping Effects in Image Registration, Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Uses Software
