Costs of $LU$ decomposition and directly solving for banded matrix
up vote
0
down vote
favorite
Let $Ainmathbb{R}^{(N+1)^{2}times(N+1)^{2}}$ be a matrix with a banded sparsity structure, only on diagonal $-N,-1,0,1$ and $N$ there are nonzero elements. My question is: how are the computationals costs of the $LU$ factorization and directly solving for matrix $A$ influenced by the sparsity structure of $A$ and the fact that it's lowest and highet bandwidth's are $-N$ and $N$?
matrix-decomposition floating-point sparse-matrices lu-decomposition
add a comment |
up vote
0
down vote
favorite
Let $Ainmathbb{R}^{(N+1)^{2}times(N+1)^{2}}$ be a matrix with a banded sparsity structure, only on diagonal $-N,-1,0,1$ and $N$ there are nonzero elements. My question is: how are the computationals costs of the $LU$ factorization and directly solving for matrix $A$ influenced by the sparsity structure of $A$ and the fact that it's lowest and highet bandwidth's are $-N$ and $N$?
matrix-decomposition floating-point sparse-matrices lu-decomposition
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Let $Ainmathbb{R}^{(N+1)^{2}times(N+1)^{2}}$ be a matrix with a banded sparsity structure, only on diagonal $-N,-1,0,1$ and $N$ there are nonzero elements. My question is: how are the computationals costs of the $LU$ factorization and directly solving for matrix $A$ influenced by the sparsity structure of $A$ and the fact that it's lowest and highet bandwidth's are $-N$ and $N$?
matrix-decomposition floating-point sparse-matrices lu-decomposition
Let $Ainmathbb{R}^{(N+1)^{2}times(N+1)^{2}}$ be a matrix with a banded sparsity structure, only on diagonal $-N,-1,0,1$ and $N$ there are nonzero elements. My question is: how are the computationals costs of the $LU$ factorization and directly solving for matrix $A$ influenced by the sparsity structure of $A$ and the fact that it's lowest and highet bandwidth's are $-N$ and $N$?
matrix-decomposition floating-point sparse-matrices lu-decomposition
matrix-decomposition floating-point sparse-matrices lu-decomposition
asked 2 days ago
R.Sluij
206
206
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3007720%2fcosts-of-lu-decomposition-and-directly-solving-for-banded-matrix%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown