Back| K- |
| Kahan Kahan with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating see w. Kahan "accurate eigenvalues of a symmetric tridiagona university, july 21, 1966. with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating see w. Kahan "accurate eigenvalues of a symmetric tridiagona university, july 21, 1966. with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating with guaranteed high relative accuracy," by demmel and Kahan, lapack working note #3 see "on the correctness of parallel bisection in floating |
| KASE KASE should be overwritten by a * x, if KASE=1 where a' is the conjugate transpose of a, and pclacon must should be overwritten by a * x, if KASE=1 pdlacon must be re-called with all the other parameters should be overwritten by a * x, if KASE=1 pslacon must be re-called with all the other parameters should be overwritten by a * x, if KASE=1 where a' is the conjugate transpose of a, and pzlacon must |
| keep keep ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. at present, ia, ja, mb and nb are restricted to those values allowed by pchetrd to keep the interface simple. these restrictions ar we keep the block column of a up-to-date to minimize th the block column of a is reasonably load balanced whereas ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. at present, ia, ja, mb and nb are restricted to those values allowed by pdsytrd to keep the interface simple. these restrictions ar we keep the block column of a up-to-date to minimize th the block column of a is reasonably load balanced whereas ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. at present, ia, ja, mb and nb are restricted to those values allowed by pssytrd to keep the interface simple. these restrictions ar we keep the block column of a up-to-date to minimize th the block column of a is reasonably load balanced whereas ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. at present, ia, ja, mb and nb are restricted to those values allowed by pzhetrd to keep the interface simple. these restrictions ar we keep the block column of a up-to-date to minimize th the block column of a is reasonably load balanced whereas |
| keeps keeps ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. pjlaenv is patterned after ilaenv and keeps the same interface i used at present in scalapack. most scalapack codes use the input ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. ipiv (local input) integer array, dimension locr(m_a)+mb_a keeps track of the pivoting information. ipiv(i) is th array is tied to the distributed matrix a. |
| KEY KEY KEY (global input) integer array, dimension( n eigenvectors. KEY (global input) integer array, dimension( n eigenvectors. KEY (global input) integer array, dimension( n eigenvectors. KEY (global input) integer array, dimension( n eigenvectors. |
| know know is returned. note that when range='v', pcheevx does not know how many eigenvectors are requested unti and as long as lrwork is large enough to allow pcheevx to is returned. note that when range='v', pchegvx does not know how many eigenvectors are requested unti and as long as lrwork is large enough to allow pchegvx to it could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none arguments (only the first nsplit elements will actually be used, but since the user cannot know a priori what value nsplit wil it could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none. see dlaed3 for details arguments is returned. note that when range='v', pdsyevx does not know how many eigenvectors are requested unti and as long as lwork is large enough to allow pdsyevx to is returned. note that when range='v', pdsygvx does not know how many eigenvectors are requested unti and as long as lwork is large enough to allow pdsygvx to it could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none arguments (only the first nsplit elements will actually be used, but since the user cannot know a priori what value nsplit wil it could conceivably fail on hexadecimal or decimal machines without guard digits, but we know of none. see slaed3 for details arguments is returned. note that when range='v', pssyevx does not know how many eigenvectors are requested unti and as long as lwork is large enough to allow pssyevx to is returned. note that when range='v', pssygvx does not know how many eigenvectors are requested unti and as long as lwork is large enough to allow pssygvx to is returned. note that when range='v', pzheevx does not know how many eigenvectors are requested unti and as long as lrwork is large enough to allow pzheevx to is returned. note that when range='v', pzhegvx does not know how many eigenvectors are requested unti and as long as lrwork is large enough to allow pzhegvx to |
| kth kth the factorization is obtained by householder's method. the kth introduce zeros into the (m - k + 1)th row of sub( a ), is given in the factorization is obtained by householder's method. the kth introduce zeros into the (m - k + 1)th row of sub( a ), is given in the factorization is obtained by householder's method. the kth the (m - k + 1)th row of sub( a ), is given in the form the factorization is obtained by householder's method. the kth the (m - k + 1)th row of sub( a ), is given in the form the factorization is obtained by householder's method. the kth the (m - k + 1)th row of sub( a ), is given in the form the factorization is obtained by householder's method. the kth the (m - k + 1)th row of sub( a ), is given in the form the factorization is obtained by householder's method. the kth introduce zeros into the (m - k + 1)th row of sub( a ), is given in the factorization is obtained by householder's method. the kth introduce zeros into the (m - k + 1)th row of sub( a ), is given in |