Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling,as developed in[10].The main results consist of a new derivation of the Gaussian type cubat...Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling,as developed in[10].The main results consist of a new derivation of the Gaussian type cubature for the product Chebyshev weight functions and associated interpolation polynomials on[-1,1]~2,as well as new results on[-1,1]~3.In particular,compact formulas for the fundamental interpolation polynomials are derived,based on n^3/4+(?)(n^2) nodes of a cubature formula on [-1,1]~3.展开更多
A geometric intrinsic pre-processing algorithm(GPA for short)for solving largescale discrete mathematical-physical PDE in 2-D and 3-D case has been presented by Sun(in 2022–2023).Different from traditional preconditi...A geometric intrinsic pre-processing algorithm(GPA for short)for solving largescale discrete mathematical-physical PDE in 2-D and 3-D case has been presented by Sun(in 2022–2023).Different from traditional preconditioning,the authors apply the intrinsic geometric invariance,the Grid matrix G and the discrete PDE mass matrix B,stiff matrix A satisfies commutative operator BG=GB and AG=GA,where G satisfies G^(m)=I,m<<dim(G).A large scale system solvers can be replaced to a more smaller block-solver as a pretreatment in real or complex domain.In this paper,the authors expand their research to 2-D and 3-D mathematical physical equations over more wide polyhedron grids such as triangle,square,tetrahedron,cube,and so on.They give the general form of pre-processing matrix,theory and numerical test of GPA.The conclusion that“the parallelism of geometric mesh pre-transformation is mainly proportional to the number of faces of polyhedron”is obtained through research,and it is further found that“commutative of grid mesh matrix and mass matrix is an important basis for the feasibility and reliability of GPA algorithm”.展开更多
In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of (d + 1)! simplices. As two examples, in 2-D and 3-D c...In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of (d + 1)! simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a parallel hexagon and a parallel quadrilateral dodecahedron, respectively. We have extended most of concepts and results of the traditional Fourier methods on multivariate cases, such as Fourier basis system, Fourier series, discrete Fourier transform (DFT) and its fast algorithm (FFT) on the super-simplex, as well as generalized sine and cosine transforms (DST, DCT) and related fast algorithms over a simplex. The relationship between the basic orthogonal system and eigen-functions of a LaDlacian-like operator over these domains is explored.展开更多
基金supported by NSFC Grants 10601056,10431050 and 60573023supported by National Basic Research Program grant 2005CB321702supported by NSF Grant DMS-0604056.
文摘Several cubature formulas on the cubic domains are derived using the discrete Fourier analysis associated with lattice tiling,as developed in[10].The main results consist of a new derivation of the Gaussian type cubature for the product Chebyshev weight functions and associated interpolation polynomials on[-1,1]~2,as well as new results on[-1,1]~3.In particular,compact formulas for the fundamental interpolation polynomials are derived,based on n^3/4+(?)(n^2) nodes of a cubature formula on [-1,1]~3.
基金supported by the Basic Research Plan on High Performance Computing of Institute of Software(No.ISCAS-PYFX-202302)the National Key R&D Program of China(No.2020YFB1709502)the Advanced Space Propulsion Laboratory of BICE and Beijing Engineering Research Center of Efficient and Green Aerospace Propulsion Technology(No.Lab ASP-2019-03)。
文摘A geometric intrinsic pre-processing algorithm(GPA for short)for solving largescale discrete mathematical-physical PDE in 2-D and 3-D case has been presented by Sun(in 2022–2023).Different from traditional preconditioning,the authors apply the intrinsic geometric invariance,the Grid matrix G and the discrete PDE mass matrix B,stiff matrix A satisfies commutative operator BG=GB and AG=GA,where G satisfies G^(m)=I,m<<dim(G).A large scale system solvers can be replaced to a more smaller block-solver as a pretreatment in real or complex domain.In this paper,the authors expand their research to 2-D and 3-D mathematical physical equations over more wide polyhedron grids such as triangle,square,tetrahedron,cube,and so on.They give the general form of pre-processing matrix,theory and numerical test of GPA.The conclusion that“the parallelism of geometric mesh pre-transformation is mainly proportional to the number of faces of polyhedron”is obtained through research,and it is further found that“commutative of grid mesh matrix and mass matrix is an important basis for the feasibility and reliability of GPA algorithm”.
基金This work was partly supported by National Science Foundation of China (No. 10431050 and 60573023), the Major Basic Project of China (2005CB321702) and by Natural Science Foundation of United States (No. CCF0305666) during the author's visit at University of Colorado at Boulder.
文摘In this paper we propose the well-known Fourier method on some non-tensor product domains in Rd, including simplex and so-called super-simplex which consists of (d + 1)! simplices. As two examples, in 2-D and 3-D case a super-simplex is shown as a parallel hexagon and a parallel quadrilateral dodecahedron, respectively. We have extended most of concepts and results of the traditional Fourier methods on multivariate cases, such as Fourier basis system, Fourier series, discrete Fourier transform (DFT) and its fast algorithm (FFT) on the super-simplex, as well as generalized sine and cosine transforms (DST, DCT) and related fast algorithms over a simplex. The relationship between the basic orthogonal system and eigen-functions of a LaDlacian-like operator over these domains is explored.