CRAIG

swMATH45184MaRDI QIDQ5974493FDOQ5974493

Author name not available (Why is that?)

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

• Error bounds for computed least squares estimators
• Semidefinite programming for the educational testing problem
• The joint bidiagonalization process with partial reorthogonalization
• A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
• Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
• Coordinate difference matrices
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• Sparse QR factorization on a massively parallel computer
• Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
• A polynomial based iterative method for linear parabolic equations
• Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix.
• A hybrid LSMR algorithm for large-scale Tikhonov regularization
• Random walks on simplicial complexes and the normalized Hodge 1-Laplacian
• A mapped polynomial method for high-accuracy approximations on arbitrary grids
• Title not available (Why is that?)
• Krylov Subspace Solvers and Preconditioners
• A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization
• A new iterative model updating technique based on least squares minimal residual method using measured modal data
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
• The Glowinski-Le Tallec splitting method revisited: a general convergence and convergence rate analysis
• Preconditioners for symmetrized Toeplitz and multilevel Toeplitz matrices
• Solving Hankel matrix approximation problem using semidefinite programming
• Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
• Peaks, plateaus, numerical instabilities in a Galerkin minimal residual pair of methods for solving \(Ax=b\)
• Large scale least squares scattered data fitting
• Improvement of the minimal residual method for solving nonsymmetric linear systems
• Conditioning of multiple-point statistics facies simulations to tomographic images
• Fitting multiple Bell curves stably and accurately to a time series as applied to Hubbert cycles or other phenomena
• A note on sampling recovery of multivariate functions in the uniform norm
• Preconditioning and Iterative Solution of All-at-Once Systems for Evolutionary Partial Differential Equations
• Using program package NSPCG to analyze the trunk reservation service protection method
• Preconditioners for rank deficient least squares problems
• Compression approaches for the regularized solutions of linear systems from large-scale inverse problems
• A new iterative method for solving linear Fredholm integral equations using the least squares method
• Golub-Kahan bidiagonalization for ill-conditioned tensor equations with applications
• Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
• Application of fractional derivatives for obtaining new Tikhonov regularization matrices
• Approximate Toeplitz matrix problem using semidefinite programming
• A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation
• A class of incomplete orthogonal factorization methods. II: Implemetation and results
• A flow perspective on nonlinear least-squares problems
• Efficient GOCE satellite gravity field recovery based on least-squares using QR decomposition
• A framework for regularization via operator approximation
• Macroscopically consistent non-local modeling of heterogeneous media
• Fast boundary-domain integral method for heat transfer simulations
• A preconditioned MINRES method for nonsymmetric Toeplitz matrices
• Implementing an affine scaling algorithm for linear programming
• On iterative solution of the extended normal equations
• A stopping criterion for the iterative solution of partial differential equations
• Regularization parameter estimation for large-scale Tikhonov regularization using a priori information
• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• On Tikhonov-type regularization with approximated penalty terms
• Modulus methods for nonnegatively constrained image restoration
• Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
• Learning multivariate functions with low-dimensional structures using polynomial bases
• 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
• A survey on variational characterizations for nonlinear eigenvalue problems
• 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
• Sharp 2-norm error bounds for LSQR and the conjugate gradient method
• Highly accurate verified error bounds for Krylov type linear system solvers
• Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
• 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
• Accuracy of preconditioned CG-type methods for least squares problems.
• 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
• An ALE particle method using upwind interpolation
• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
• Low-rank approximation of linear parabolic equations by space-time tensor Galerkin methods
• 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
• Preconditioned iterative methods for sparse linear algebra problems arising in circuit simulation
• The LSQR method for solving tensor least-squares problems
• Inversion methods in helioseismology and solar tomography
• 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
• Projection method for eigenvalue problems of linear nonsquare matrix pencils
• Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester matrix equations
• State estimation with structural priors in fMRI
• A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
• 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
• Hierarchical orthogonal factorization: sparse least squares problems

This page was built for software: CRAIG