Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 9022

{numerical-linear-algebra} questions involving algorithms for linear algebra computations.

1 vote
Accepted

Large scale least squares of non symmetric and non square problems

A widely used iterative method for large scale linear least squares problems that allows for regularization if you want/need it is the LSQR algorithm of Paige and Saunders. See http://www.stanford.ed …
Brian Borchers's user avatar
3 votes
Accepted

Decompositions of sparse symmetric matrices and methods for solving large linear equations

I agree that this is a better question for scicomp.stackexchange.com. Maybe. It depends on the sparsity structure of your particular matrix and the actual numerical values of the nonzero elements …
Brian Borchers's user avatar
1 vote

Ease of calculation of norm

I'm assuming that by $\| A^{1/2}b-z \|$, you're referring to the 2-norm and that by $A^{1/2}$, you're referring to the unique symmetric matrix square root of $A$. If you can precompute $A^{1/2}z$, …
Brian Borchers's user avatar