linear-algebra


Linear iterative solver vs direct solver stability


Is iterative solver more stable than direct solver based on LU factorization. For LU based solver, we always have cond(A) < cond(L) * cond(U), so factorization amplifies numerical inaccuracy. So in the event of an ill conditioned matrix A, whose condition number is large than 1e10, will it be better off using iterative solver for stability and numerical accuracy?
There are two factors involved into answering your question.
1) The physical system you are analyzing is ill-conditioned by itself (in mechanical terms, the system is pretty "loose", so its equilibrium state may vary greatly depending on just a small variation in the boundary conditions)
2) The physical system is OK, but the matrix has not been scaled properly before the solution process begins.
In the first case, there isn't much you can do: the physical system is inherently unstable. Consider applying different boundary conditions, for example.
In the second case, a preconditioner should be helpful; for example, the Jacobi preconditioner makes the matrix having all diagonal values equal to 1. In this case, the iterations are more likely to converge.The condition ratio of 1e10 shouldn't represent too much trouble, provided a preconditioning is used.

Related Links

How to represent a bus ride in linear programming?
Matlab : How do I ensure that the covariance matrix is positive definite when using Kalman Filter
Computing singular values vs eigenvalues when you have the choice
Solving of a linear system with parameters
Upper Division Linear Algebra
positive solutions to a homogeneous linear system
Use LispLab within AutoCAD
Eigenvalues of large symmetric matrices
Eigen - directly compute log determinant of huge sparse matrix
Calculating the coefficients of a separable state
When to use eigen and when to use Blas
Numerical Economic Computability Algorithm
Index of a maximum element in TensorFlow tensor
Efficiently multiplying matrix with transpose using cuBlas
Linear Algebra Derivation in Gertler-Karadi (2015) AEJ
Lapack Orthonormalization Function for Rectangular Matrix

Categories

HOME
service-worker
notepad++
azure-stream-analytics
microsoftgraph
oracle12c
time-complexity
ng-idle
nunit
themes
fftw
access
static-site
scripting
google-apps
mips
android-json
banner
syntaxnet
openpyxl
cmdb
endpoint
pybossa
glyphicons
job-scheduling
sencha-touch
lilypond
zxing
short-url
mount
maze
interbase
syntax-highlighting
pylons
jaws
volatile
card.io
hard-drive
apic
openproject
password-protection
css-position
datacachefactory
install.packages
microsoft-metro
glm-math
apollostack
facebook-social-plugins
pom.xml
ntvs
identification
modelsim
check-mk
janus
trigger.io
jtree
cronexpression
angular2-testing
xcode-server
tinkerpop3
dotnetnuke-7
dimension
qiime
lz77
ascii-art
atan2
concurrentmodification
dynamics-nav-2016
rate-limiting
rubaxa-sortable
graphics2d
code-documentation
apache-spark-1.3
cosine-similarity
packet-sniffers
rickshaw
trdion2011
unix-socket
ora-00904
paste
dsym
android-usb
scriptaculous
eclipse-kepler
jeromq
ebay-lms
cffile
cnf
facebook-timeline
onload-event
virtual-pc
database-create
isa-swizzling
convention
pinch
google-floodlight
drawtobitmap
globals
spread
lxr
silverlight-oob
scrubyt
wysiwym
blind

Resources

Mobile Apps Dev
Database Users
javascript
java
csharp
php
android
MS Developer
developer works
python
ios
c
html
jquery
RDBMS discuss
Cloud Virtualization
Database Dev&Adm
javascript
java
csharp
php
python
android
jquery
ruby
ios
html
Mobile App
Mobile App
Mobile App