Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
From MaRDI portal
Recommendations
- An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
- Parallel sparse Cholesky factorization on a shared memory multiprocessor
- scientific article; zbMATH DE number 4184919
- A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
- Two-dimensional block partitionings for the parallel sparse Cholesky factorization
Cited in
(47)- Generalized bootstrap method for assessment of uncertainty in semivariogram inference
- Sparse hypermatrix Cholesky: customization for high performance
- On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach
- A fast algorithm for sparse matrix computations related to inversion
- GPU-accelerated iterative solutions for finite element analysis of soil-structure interaction problems
- Sparse matrix tools for Gaussian models on lattices
- A survey of direct methods for sparse linear systems
- An efficient analyse phase for element problems.
- Sparse linear least-squares problems
- Aspects for a block version of the interval Cholesky algorithm
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- High performance sparse solver for unsymmetrical linear equations with out-of-core strategies and its application on meshless methods
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- The impact of high-performance computing in the solution of linear systems: Trends and problems
- Asymptotic properties of multivariate tapering for estimation and prediction
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- PCx: an interior-point code for linear programming
- Hypermatrix oriented supernode amalgamation
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
- Primal-dual nonlinear rescaling method for convex optimization
- A primal-dual regularized interior-point method for convex quadratic programs
- Interior-point solver for convex separable block-angular problems
- Computational experience with a modified potential reduction algorithm for linear programming
- Optimal combination forecasts for hierarchical time series
- Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
- Sampling Strategies for Fast Updating of Gaussian Markov Random Fields
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- Application ofh-adaptation for environmental fluid flow and species transport
- A new interior-point approach for large separable convex quadratic two-stage stochastic problems
- Distributed SBP Cholesky factorization algorithms with near-optimal scheduling
- A sparse proximal implementation of the LP dual active set algorithm
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
- Solving L₁-CTA in 3D tables by an interior-point method for primal block-angular problems
- PENNON: software for linear and nonlinear matrix inequalities
- Tensor product P-splines using a sparse mixed model formulation
- Most likely separation of intensity and warping effects in image registration
- Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number
- Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
- IPM based sparse LP solver on a heterogeneous processor
- Analysis of a sparse hypermatrix Cholesky with fixed-sized blocking
- Derivatives of the log of a determinant
- REML for two-dimensional P-splines
- Prim-based support-graph preconditioners for min-cost flow problems
- A Frisch-Newton algorithm for sparse quantile regression
- An interior-point approach for primal block-angular problems
- Combinatorial Aspects in Sparse Elimination Methods
This page was built for publication: Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271094)
