CRAIG

swMATH45184MaRDI QIDQ5974493FDOQ5974493

Author name not available (Why is that?)

Official website: https://stanford.edu/group/SOL/software/craig/

Cited In (only showing first 100 items - show all)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• On Tikhonov-type regularization with approximated penalty terms
• Vector extrapolation based Landweber method for discrete ill-posed problems
• The regularizing properties of global GMRES for solving large-scale linear discrete ill-posed problems with several right-hand sides
• Global least squares methods based on tensor form to solve a class of generalized Sylvester tensor equations
• LSMR iterative method for solving one- and two-dimensional linear Fredholm integral equations
• Highly accurate verified error bounds for Krylov type linear system solvers
• Anderson Accelerated Douglas--Rachford Splitting
• Trajectory-based methods for modeling and characterization
• On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
• A penalty method for PDE-constrained optimization in inverse problems
• Multipreconditioned GMRES for shifted systems
• Edge-promoting reconstruction of absorption and diffusivity in optical tomography
• Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
• Incremental regularized least squares for dimensionality reduction of large-scale data
• Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
• An ALE particle method using upwind interpolation
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
• Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
• A regularized factorization-free method for equality-constrained optimization
• Accuracy of the Lanczos process for the eigenproblem and solution of equations
• The AZ algorithm for least squares systems with a known incomplete generalized inverse
• Structure in loss of orthogonality
• Tensor methods for the Boltzmann-BGK equation
• Flexible Krylov methods for \(\ell_p\) regularization
• Bayes meets Krylov: statistically inspired preconditioners for CGLS
• An isogeometric collocation method using superconvergent points
• A multilevel block incomplete Cholesky preconditioner for solving normal equations in linear least squares problems
• Fast computation of reconciled forecasts for hierarchical and grouped time series
• Combinatorial characterization of the null spaces of symmetric H-matrices
• Edge-enhancing reconstruction algorithm for three-dimensional electrical impedance tomography
• Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization
• The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
• Goal-oriented optimal approximations of Bayesian linear inverse problems
• A new consistent splitting scheme for incompressible Navier-Stokes flows: a least-squares spectral element implementation
• An unfitted RBF-FD method in a least-squares setting for elliptic PDEs on complex geometries
• SPMR: A family of saddle-point minimum residual solvers
• A new upper bound for sampling numbers
• Stochastic-deterministic boundary element modelling of transcranial electric stimulation using a three layer head model
• The LSQR method for solving tensor least-squares problems
• Worst-case recovery guarantees for least squares approximation using random samples
• Inversion methods in helioseismology and solar tomography
• Priorconditioned CGLS-based quasi-MAP estimate, statistical stopping rule, and ranking of priors
• An interior-point implementation developed and tuned for radiation therapy treatment planning
• A general soft label based linear discriminant analysis for semi-supervised dimensionality reduction
• A Tikhonov regularized penalty function approach for solving polylinear programming problems
• A parameter choice rule for Tikhonov regularization based on predictive risk
• Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations
• State estimation with structural priors in fMRI
• Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
• A flexible uncertainty propagation framework for general multiphysics systems
• Implementing the alternating direction method of multipliers for big datasets: a case study of least absolute shrinkage and selection operator
• Statistical ranking and combinatorial Hodge theory
• Space-time discretization of the heat equation
• The stability of formulae of the Gohberg-Semencul-Trench type for Moore-Penrose and group inverses of Toeplitz matrices
• Regularization parameter determination for discrete ill-posed problems
• Computational results of an interior point algorithm for large scale linear programming
• Trust-region and other regularisations of linear least-squares problems
• Minimum residual methods for augmented systems
• Old and new parameter choice rules for discrete ill-posed problems
• LSQR
• NSPCG
• GKB-FP
• FGMRES
• LSTRS
• RestoreTools
• SparseMatrix
• SPARSE-QR
• UTV
• FaIMS
• CoDoSol
• OEIG
• MIQR
• SuiteSparseQR
• SparseM
• NFFT
• CHEBYCODE
• SuitSparseQR
• TIMP
• DYANA
• AIR tools
• Blendenpik
• smt
• LSRN
• jPlex
• FACTORIZE
• CCLIB
• MINRES-QLP
• rrgmrestbx
• spacetime
• Y12M
• DRIC
• NFFT3
• LSMR
• MA32
• HSL_MI28
• MINRES
• Rice Vector

This page was built for software: CRAIG