In this paper, we consider solving the Helmholtz equation in the Cartesian domain , subject to homogeneous Dirichlet boundary condition, discretized with the Chebyshev pseudo-spectral method. The main purpose of this ...In this paper, we consider solving the Helmholtz equation in the Cartesian domain , subject to homogeneous Dirichlet boundary condition, discretized with the Chebyshev pseudo-spectral method. The main purpose of this paper is to present the formulation of a two-level decomposition scheme for decoupling the linear system obtained from the discretization into independent subsystems. This scheme takes advantage of the homogeneity property of the physical problem along one direction to reduce a 2D problem to several 1D problems via a block diagonalization approach and the reflexivity property along the second direction to decompose each of the 1D problems to two independent subproblems using a reflexive decomposition, effectively doubling the number of subproblems. Based on the special structure of the coefficient matrix of the linear system derived from the discretization and a reflexivity property of the second-order Chebyshev differentiation matrix, we show that the decomposed submatrices exhibits a similar property, enabling the system to be decomposed using reflexive decompositions. Explicit forms of the decomposed submatrices are derived. The decomposition not only yields more efficient algorithm but introduces coarse-grain parallelism. Furthermore, it preserves all eigenvalues of the original matrix.展开更多
Generalize reflexive matrices are a special class of matrices ?that have the relation where? and ?are some generalized reflection matrices. The nontrivial cases ( or ) of this class of matrices occur very often in man...Generalize reflexive matrices are a special class of matrices ?that have the relation where? and ?are some generalized reflection matrices. The nontrivial cases ( or ) of this class of matrices occur very often in many scientific and engineering applications. They are also a generalization of centrosymmetric matrices and reflexive matrices. The main purpose of this paper is to present block decomposition schemes for generalized reflexive matrices of various types and to obtain their decomposed explicit block-diagonal structures. The decompositions make use of unitary equivalence transformations and, therefore, preserve the singular values of the matrices. They lead to more efficient sequential computations and at the same time induce large-grain parallelism as a by-product, making themselves computationally attractive for large-scale applications. A numerical example is employed to show the usefulness of the developed explicit decompositions for decoupling linear least-square problems whose coefficient matrices are of this class into smaller and independent subproblems.展开更多
In this paper, we present a unified approach to decomposing a special class of block tridiagonal matrices <i>K</i> (<i>α</i> ,<i>β</i> ) into block diagonal matrices using similar...In this paper, we present a unified approach to decomposing a special class of block tridiagonal matrices <i>K</i> (<i>α</i> ,<i>β</i> ) into block diagonal matrices using similarity transformations. The matrices <i>K</i> (<i>α</i> ,<i>β</i> )∈ <i>R</i><sup><i>pq</i>× <i>pq</i></sup> are of the form <i>K</i> (<i>α</i> ,<i>β</i> = block-tridiag[<i>β B</i>,<i>A</i>,<i>α B</i>] for three special pairs of (<i>α</i> ,<i>β</i> ): <i>K</i> (1,1), <i>K</i> (1,2) and <i>K</i> (2,2) , where the matrices <i>A</i> and <i>B</i>, <i>A</i>, <i>B</i>∈ <i>R</i><sup><i>p</i>× <i>q</i></sup> , are general square matrices. The decomposed block diagonal matrices <img src="Edit_00717830-3b3b-4856-8ecd-a9db983fef19.png" width="15" height="15" alt="" />(<i>α</i> ,<i>β</i> ) for the three cases are all of the form: <img src="Edit_71ffcd27-6acc-4922-b5e2-f4be15b9b8dc.png" width="15" height="15" alt="" />(<i>α</i> ,<i>β</i> ) = <i>D</i><sub>1</sub> (<i>α</i> ,<i>β</i> ) ⊕ <i>D</i><sub>2</sub> (<i>α</i> ,<i>β</i> ) ⊕---⊕ <i>D</i><sub>q</sub> (<i>α</i> ,<i>β</i> ) , where <i>D<sub>k</sub></i> (<i>α</i> ,<i>β</i> ) = <i>A</i>+ 2cos ( <i>θ<sub>k</sub></i> (<i>α</i> ,<i>β</i> )) <i>B</i>, in which <i>θ<sub>k</sub></i> (<i>α</i> ,<i>β</i> ) , k = 1,2, --- q , depend on the values of <i>α</i> and <i>β</i>. Our decomposition method is closely related to the classical fast Poisson solver using Fourier analysis. Unlike the fast Poisson solver, our approach decomposes <i>K</i> (<i>α</i> ,<i>β</i> ) into <i>q</i> diagonal blocks, instead of <i>p</i> blocks. Furthermore, our proposed approach does not require matrices <i>A</i> and <i>B</i> to be symmetric and commute, and employs only the eigenvectors of the tridiagonal matrix <i>T</i> (<i>α</i> ,<i>β</i> ) = tridiag[<i>β b</i>, <i>a</i>,<i>αb</i>] in a block form, where <i>a</i> and <i>b</i> are scalars. The transformation matrices, their inverses, and the explicit form of the decomposed block diagonal matrices are derived in this paper. Numerical examples and experiments are also presented to demonstrate the validity and usefulness of the approach. Due to the decoupled nature of the decomposed matrices, this approach lends itself to parallel and distributed computations for solving both linear systems and eigenvalue problems using multiprocessors.展开更多
文摘In this paper, we consider solving the Helmholtz equation in the Cartesian domain , subject to homogeneous Dirichlet boundary condition, discretized with the Chebyshev pseudo-spectral method. The main purpose of this paper is to present the formulation of a two-level decomposition scheme for decoupling the linear system obtained from the discretization into independent subsystems. This scheme takes advantage of the homogeneity property of the physical problem along one direction to reduce a 2D problem to several 1D problems via a block diagonalization approach and the reflexivity property along the second direction to decompose each of the 1D problems to two independent subproblems using a reflexive decomposition, effectively doubling the number of subproblems. Based on the special structure of the coefficient matrix of the linear system derived from the discretization and a reflexivity property of the second-order Chebyshev differentiation matrix, we show that the decomposed submatrices exhibits a similar property, enabling the system to be decomposed using reflexive decompositions. Explicit forms of the decomposed submatrices are derived. The decomposition not only yields more efficient algorithm but introduces coarse-grain parallelism. Furthermore, it preserves all eigenvalues of the original matrix.
文摘Generalize reflexive matrices are a special class of matrices ?that have the relation where? and ?are some generalized reflection matrices. The nontrivial cases ( or ) of this class of matrices occur very often in many scientific and engineering applications. They are also a generalization of centrosymmetric matrices and reflexive matrices. The main purpose of this paper is to present block decomposition schemes for generalized reflexive matrices of various types and to obtain their decomposed explicit block-diagonal structures. The decompositions make use of unitary equivalence transformations and, therefore, preserve the singular values of the matrices. They lead to more efficient sequential computations and at the same time induce large-grain parallelism as a by-product, making themselves computationally attractive for large-scale applications. A numerical example is employed to show the usefulness of the developed explicit decompositions for decoupling linear least-square problems whose coefficient matrices are of this class into smaller and independent subproblems.
文摘In this paper, we present a unified approach to decomposing a special class of block tridiagonal matrices <i>K</i> (<i>α</i> ,<i>β</i> ) into block diagonal matrices using similarity transformations. The matrices <i>K</i> (<i>α</i> ,<i>β</i> )∈ <i>R</i><sup><i>pq</i>× <i>pq</i></sup> are of the form <i>K</i> (<i>α</i> ,<i>β</i> = block-tridiag[<i>β B</i>,<i>A</i>,<i>α B</i>] for three special pairs of (<i>α</i> ,<i>β</i> ): <i>K</i> (1,1), <i>K</i> (1,2) and <i>K</i> (2,2) , where the matrices <i>A</i> and <i>B</i>, <i>A</i>, <i>B</i>∈ <i>R</i><sup><i>p</i>× <i>q</i></sup> , are general square matrices. The decomposed block diagonal matrices <img src="Edit_00717830-3b3b-4856-8ecd-a9db983fef19.png" width="15" height="15" alt="" />(<i>α</i> ,<i>β</i> ) for the three cases are all of the form: <img src="Edit_71ffcd27-6acc-4922-b5e2-f4be15b9b8dc.png" width="15" height="15" alt="" />(<i>α</i> ,<i>β</i> ) = <i>D</i><sub>1</sub> (<i>α</i> ,<i>β</i> ) ⊕ <i>D</i><sub>2</sub> (<i>α</i> ,<i>β</i> ) ⊕---⊕ <i>D</i><sub>q</sub> (<i>α</i> ,<i>β</i> ) , where <i>D<sub>k</sub></i> (<i>α</i> ,<i>β</i> ) = <i>A</i>+ 2cos ( <i>θ<sub>k</sub></i> (<i>α</i> ,<i>β</i> )) <i>B</i>, in which <i>θ<sub>k</sub></i> (<i>α</i> ,<i>β</i> ) , k = 1,2, --- q , depend on the values of <i>α</i> and <i>β</i>. Our decomposition method is closely related to the classical fast Poisson solver using Fourier analysis. Unlike the fast Poisson solver, our approach decomposes <i>K</i> (<i>α</i> ,<i>β</i> ) into <i>q</i> diagonal blocks, instead of <i>p</i> blocks. Furthermore, our proposed approach does not require matrices <i>A</i> and <i>B</i> to be symmetric and commute, and employs only the eigenvectors of the tridiagonal matrix <i>T</i> (<i>α</i> ,<i>β</i> ) = tridiag[<i>β b</i>, <i>a</i>,<i>αb</i>] in a block form, where <i>a</i> and <i>b</i> are scalars. The transformation matrices, their inverses, and the explicit form of the decomposed block diagonal matrices are derived in this paper. Numerical examples and experiments are also presented to demonstrate the validity and usefulness of the approach. Due to the decoupled nature of the decomposed matrices, this approach lends itself to parallel and distributed computations for solving both linear systems and eigenvalue problems using multiprocessors.