triangular matrices
(0.002 seconds)
11—20 of 43 matching pages
11: 9.19 Approximations
…
►
•
…
Corless et al. (1992) describe a method of approximation based on subdividing into a triangular mesh, with values of , stored at the nodes. and are then computed from Taylor-series expansions centered at one of the nearest nodes. The Taylor coefficients are generated by recursion, starting from the stored values of , at the node. Similarly for , .
12: 35.5 Bessel Functions of Matrix Argument
13: 35.3 Multivariate Gamma and Beta Functions
14: Bille C. Carlson
…
►In theoretical physics he is known for the “Carlson-Keller Orthogonalization”, published in 1957, Orthogonalization Procedures and the Localization of Wannier Functions, and the “Carlson-Keller Theorem”, published in 1961, Eigenvalues of Density Matrices.
…
15: 21.1 Special Notation
…
►
►
…
►Uppercase boldface letters are real or complex matrices.
…
positive integers. | |
… | |
set of all matrices with integer elements. | |
… |
16: 35.2 Laplace Transform
17: 21.6 Products
…
►
21.6.1
►that is, is the set of all
matrices that are obtained by premultiplying by any matrix with integer elements; two such matrices in are considered equivalent if their difference is a matrix with integer elements.
…
►
21.6.3
…
►
21.6.4
…
18: 35.4 Partitions and Zonal Polynomials
19: 35.6 Confluent Hypergeometric Functions of Matrix Argument
20: 19.31 Probability Distributions
…
►More generally, let () and () be real positive-definite matrices with rows and columns, and let be the eigenvalues of .
…