Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with...Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.展开更多
In this paper,hierarchical basis method for second order nonsymmetric andindefinite elliptic problem on a polygonal domain(possibly nonconvex)discreted by avertex-centered covolume method is constructed.
The radial basis function （RBF） interpolation approach proposed by Freedman is used to solve inverse problems encountered in well-logging and other petrophysical issues. The approach is to predict petrophysical prop...The radial basis function （RBF） interpolation approach proposed by Freedman is used to solve inverse problems encountered in well-logging and other petrophysical issues. The approach is to predict petrophysical properties in the laboratory on the basis of physical rock datasets, which include the formation factor, viscosity, permeability, and molecular composition. However, this approach does not consider the effect of spatial distribution of the calibration data on the interpolation result. This study proposes a new RBF interpolation approach based on the Freedman＇s RBF interpolation approach, by which the unit basis functions are uniformly populated in the space domain. The inverse results of the two approaches are comparatively analyzed by using our datasets. We determine that although the interpolation effects of the two approaches are equivalent, the new approach is more flexible and beneficial for reducing the number of basis functions when the database is large, resulting in simplification of the interpolation function expression. However, the predicted results of the central data are not sufficiently satisfied when the data clusters are far apart.展开更多
In the paper,a reduced basis(RB)method for time-dependent nonlocal problems with a special parameterized fractional Laplace kernel function is proposed.Because of the lack of sparsity of discretized nonlocal systems c...In the paper,a reduced basis(RB)method for time-dependent nonlocal problems with a special parameterized fractional Laplace kernel function is proposed.Because of the lack of sparsity of discretized nonlocal systems compared to corresponding local partial differential equation(PDE)systems,model reduction for nonlocal systems becomes more critical.The method of snapshots and greedy(MOS-greedy)algorithm of RB method is developed for nonlocal problems with random inputs,which provides an efficient and reliable approximation of the solution.A major challenge lies in the excessive influence of the time domain on the model reduction process.To address this,the Fourier transform is applied to convert the original time-dependent parabolic equation into a frequency-dependent elliptic equation,where variable frequencies are independent.This enables parallel computation for approximating the solution in the frequency domain.Finally,the proposed MOS-greedy algorithm is applied to the nonlocal diffusion problems.Numerical results demonstrate that it provides an accurate approximation of the full order problems and significantly improves computational efficiency.展开更多
The reduced basis methods (RBM) have been demonstrated as a promising numerical technique for statics problems and are extended to structural dynamic problems in this paper. Direct step-by-step integration and mode su...The reduced basis methods (RBM) have been demonstrated as a promising numerical technique for statics problems and are extended to structural dynamic problems in this paper. Direct step-by-step integration and mode superposition are the most widely used methods in the field of the finite element analysis of structural dynamic response and solid mechanics. Herein these two methods are both transformed into reduced forms according to the proposed reduced basis methods. To generate a reduced surrogate model with small size, a greedy algorithm is suggested to construct sample set and reduced basis space adaptively in a prescribed training parameter space. For mode superposition method, the reduced basis space comprises the truncated eigenvectors from generalized eigenvalue problem associated with selected sample parameters. The reduced generalized eigenvalue problem is obtained by the projection of original generalized eigenvalue problem onto the reduced basis space. In the situation of direct integration, the solutions of the original increment formulation corresponding to the sample set are extracted to construct the reduced basis space. The reduced increment formulation is formed by the same method as mode superposition method. Numerical example is given in Section 5 to validate the efficiency of the presented reduced basis methods for structural dynamic problems.展开更多
In this article,a meshless method using the spacetime collocation for solving the two-dimensional backward heat conduction problem(BHCP)is proposed.The spacetime collocation meshless method(SCMM)is to derive the gener...In this article,a meshless method using the spacetime collocation for solving the two-dimensional backward heat conduction problem(BHCP)is proposed.The spacetime collocation meshless method(SCMM)is to derive the general solutions as the basis functions for the two-dimensional transient heat equation using the separation of variables.Numerical solutions of the heat conduction problem are expressed as a series using the addition theorem.Because the basis functions are the general solutions of the governing equation,the boundary points may be collocated on the spacetime boundary of the domain.The proposed method is verified by conducting several heat conduction problems.We also carry out numerical applications to compare the SCMM with other meshless methods.The results show that the SCMM is accurate and efficient.Furthermore,it is found that the recovered boundary data on inaccessible boundary can be obtained with high accuracy even though the over specified data are provided only at a 1/6 portion of the spacetime boundary.展开更多
In this paper,the boundary knot method is applied to simulate inverse problems of determining physical boundary occurring in an inaccessible interior part.This is fulfilled from measurements of the partially accessibl...In this paper,the boundary knot method is applied to simulate inverse problems of determining physical boundary occurring in an inaccessible interior part.This is fulfilled from measurements of the partially accessible outer boundary.The truncated singular value decomposition under parameter choice of the cross validation method is employed for noisy boundary data cases.Numerical results for two benchmark problems show that the boundary knot method is simple,accurate,stable and computationally efficient for inverse problems under domains with doubly connected domains.展开更多
Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main ...Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main features of the problem are the strong nonuniform scale of the solution and large errors (up to 15%) in the input data. In both algorithms, the solution is represented as decomposition on special basic functions, which satisfy given a priori information on solution, and this idea allow us significantly to improve the quality of approximate solution and simplify solving the minimization problem. The theoretical details of the algorithms, as well as the results of numerical experiments for proving robustness of the algorithms, are presented.展开更多
This research develops an accurate and efficient method for the Perspective-n-Line(Pn L)problem. The developed method addresses and solves Pn L via exploiting the problem’s geometry in a non-linear least squares fash...This research develops an accurate and efficient method for the Perspective-n-Line(Pn L)problem. The developed method addresses and solves Pn L via exploiting the problem’s geometry in a non-linear least squares fashion. Specifically, by representing the rotation matrix with a novel quaternion parameterization, the Pn L problem is first decomposed into four independent subproblems. Then, each subproblem is reformulated as an unconstrained minimization problem, in which the Kronecker product is adopted to write the cost function in a more compact form. Finally, the Groobner basis technique is used to solve the polynomial system derived from the first-order optimality conditions of the cost function. Moreover, a novel strategy is presented to improve the efficiency of the algorithm. It is improved by exploiting structure information embedded in the rotation parameterization to accelerate the computing of coefficient matrix of a cost function. Experiments on synthetic data and real images show that the developed method is comparable to or better than state-of-the-art methods in accuracy, but with reduced computational requirements.展开更多
An improved interpolating complex variable element-frees Galerkin(IICVEFG)method for the two-dimensional elastic problems is developed.This method is based on the improved interpolating complex variable moving least-s...An improved interpolating complex variable element-frees Galerkin(IICVEFG)method for the two-dimensional elastic problems is developed.This method is based on the improved interpolating complex variable moving least-squares(IICVMLS)method and the integral form of the elastic problems.In the IICVEFG method,the proposed shape function has the interpolating feature.Therefore,the essential boundary conditions can be exerted directly.Additionally,the unnecessary t erms in the discrete mat rices are removed,which resul ts in a set of concise formulas.This method is verified by analyzing three elastic examples under different constraints and loads.The numerical results show that the IICVEFG method is superior in precision and efficiency to other non-interpolating meshless methods.展开更多
A local meshless method is applied to find the numerical solutions of two classes of inverse problems in parabolic equations. The problem is reconstructing the source term using a solution specified at some internal p...A local meshless method is applied to find the numerical solutions of two classes of inverse problems in parabolic equations. The problem is reconstructing the source term using a solution specified at some internal points;one class is that the source term is time dependent, and the other class is that the source term is time and space dependent. Some numerical experiments are presented and discussed.展开更多
In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of thi...In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of this paper.Firstly,we establish a scheme to approximate the optimality system by using the finite volume element method in the physical space and the meshfree method in the probability space,which is competitive for high-dimensional random inputs.Secondly,the a priori error estimates are derived for the state,the co-state and the control variables.Some numerical tests are carried out to confirm the theoretical results and demonstrate the efficiency of the proposed method.展开更多
Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet ...Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.展开更多
To optimize the algorithms for the dihedral hidden subgroup problem,we present a new algorithm based on lattice basis reduction algorithm.For n\120,we reduce the dihedral hidden subgroup problem to shortest vector pro...To optimize the algorithms for the dihedral hidden subgroup problem,we present a new algorithm based on lattice basis reduction algorithm.For n\120,we reduce the dihedral hidden subgroup problem to shortest vector problem.A subroutine is given to get a transition quantum state by constructing a phase filter function,and then the measurement basis are derived based on the lattice basis reduction algorithm for solving low density subset sum problem.Finally,the parity of slope s is revealed by the measurement.This algorithm needs preparing mn quantum states,m qubits to store and O(n2)classical space,which is superior to existing algorithms.展开更多
Let X＊ be a free monoid over an alphabet X and W be a finite language over X. Let S（W） be the Rees quotient X＊/I（W）, where I（W） is the ideal of X＊ consisting of all elements of X＊ that are not subwords of W....Let X＊ be a free monoid over an alphabet X and W be a finite language over X. Let S（W） be the Rees quotient X＊/I（W）, where I（W） is the ideal of X＊ consisting of all elements of X＊ that are not subwords of W. Then S（W） is a finite monoid with zero and is called the discrete syntactic monoid of W. W is called finitely based if the monoid S（W） is finitely based. In this paper, we give some sufficient conditions for a monoid to be non-finitely based. Using these conditions and other results, we describe all finitely based 2-limited words over a three-element alphabet. Furthermore, an explicit algorithm is given to decide that whether or not a 2-limited word in which there are exactly two non-linear letters is finitely based.展开更多
文摘Accurately approximating higher order derivatives is an inherently difficult problem. It is shown that a random variable shape parameter strategy can improve the accuracy of approximating higher order derivatives with Radial Basis Function methods. The method is used to solve fourth order boundary value problems. The use and location of ghost points are examined in order to enforce the extra boundary conditions that are necessary to make a fourth-order problem well posed. The use of ghost points versus solving an overdetermined linear system via least squares is studied. For a general fourth-order boundary value problem, the recommended approach is to either use one of two novel sets of ghost centers introduced here or else to use a least squares approach. When using either ghost centers or least squares, the random variable shape parameter strategy results in significantly better accuracy than when a constant shape parameter is used.
基金This work was supported by the National Natural Science Foundation of China under grant 10071015
文摘In this paper,hierarchical basis method for second order nonsymmetric andindefinite elliptic problem on a polygonal domain(possibly nonconvex)discreted by avertex-centered covolume method is constructed.
基金supported by the National Science and Technology Major Projects(No.2011ZX05020-008)Well Logging Advanced Technique and Application Basis Research Project of Petrochina Company(No.2011A-3901)
文摘The radial basis function （RBF） interpolation approach proposed by Freedman is used to solve inverse problems encountered in well-logging and other petrophysical issues. The approach is to predict petrophysical properties in the laboratory on the basis of physical rock datasets, which include the formation factor, viscosity, permeability, and molecular composition. However, this approach does not consider the effect of spatial distribution of the calibration data on the interpolation result. This study proposes a new RBF interpolation approach based on the Freedman＇s RBF interpolation approach, by which the unit basis functions are uniformly populated in the space domain. The inverse results of the two approaches are comparatively analyzed by using our datasets. We determine that although the interpolation effects of the two approaches are equivalent, the new approach is more flexible and beneficial for reducing the number of basis functions when the database is large, resulting in simplification of the interpolation function expression. However, the predicted results of the central data are not sufficiently satisfied when the data clusters are far apart.
基金supported by the Guangdong Basic and Applied Basic Research Foundation,China(Grant 2024A1515012548)supported by the National Natural Science Foundation of China(Grant 12401567)+1 种基金by the 2023 Guangzhou Basic and Applied Basic Research Project(Grant 2023A04J0035)by the Talent Special Projects of School-level Scientific Research Programs under Guangdong Poiytechnic Normal University(Grant 2022SDKYA025).
文摘In the paper,a reduced basis(RB)method for time-dependent nonlocal problems with a special parameterized fractional Laplace kernel function is proposed.Because of the lack of sparsity of discretized nonlocal systems compared to corresponding local partial differential equation(PDE)systems,model reduction for nonlocal systems becomes more critical.The method of snapshots and greedy(MOS-greedy)algorithm of RB method is developed for nonlocal problems with random inputs,which provides an efficient and reliable approximation of the solution.A major challenge lies in the excessive influence of the time domain on the model reduction process.To address this,the Fourier transform is applied to convert the original time-dependent parabolic equation into a frequency-dependent elliptic equation,where variable frequencies are independent.This enables parallel computation for approximating the solution in the frequency domain.Finally,the proposed MOS-greedy algorithm is applied to the nonlocal diffusion problems.Numerical results demonstrate that it provides an accurate approximation of the full order problems and significantly improves computational efficiency.
文摘The reduced basis methods (RBM) have been demonstrated as a promising numerical technique for statics problems and are extended to structural dynamic problems in this paper. Direct step-by-step integration and mode superposition are the most widely used methods in the field of the finite element analysis of structural dynamic response and solid mechanics. Herein these two methods are both transformed into reduced forms according to the proposed reduced basis methods. To generate a reduced surrogate model with small size, a greedy algorithm is suggested to construct sample set and reduced basis space adaptively in a prescribed training parameter space. For mode superposition method, the reduced basis space comprises the truncated eigenvectors from generalized eigenvalue problem associated with selected sample parameters. The reduced generalized eigenvalue problem is obtained by the projection of original generalized eigenvalue problem onto the reduced basis space. In the situation of direct integration, the solutions of the original increment formulation corresponding to the sample set are extracted to construct the reduced basis space. The reduced increment formulation is formed by the same method as mode superposition method. Numerical example is given in Section 5 to validate the efficiency of the presented reduced basis methods for structural dynamic problems.
文摘In this article,a meshless method using the spacetime collocation for solving the two-dimensional backward heat conduction problem(BHCP)is proposed.The spacetime collocation meshless method(SCMM)is to derive the general solutions as the basis functions for the two-dimensional transient heat equation using the separation of variables.Numerical solutions of the heat conduction problem are expressed as a series using the addition theorem.Because the basis functions are the general solutions of the governing equation,the boundary points may be collocated on the spacetime boundary of the domain.The proposed method is verified by conducting several heat conduction problems.We also carry out numerical applications to compare the SCMM with other meshless methods.The results show that the SCMM is accurate and efficient.Furthermore,it is found that the recovered boundary data on inaccessible boundary can be obtained with high accuracy even though the over specified data are provided only at a 1/6 portion of the spacetime boundary.
基金Supported by the Natural Science Foundation of Anhui Province(1908085QA09)the Natural Science Research Project of Anhui Province(KJ2019A0591&KJ2017B015)Higher Education Department of the Ministry of Education(201802358008)。
文摘In this paper,the boundary knot method is applied to simulate inverse problems of determining physical boundary occurring in an inaccessible interior part.This is fulfilled from measurements of the partially accessible outer boundary.The truncated singular value decomposition under parameter choice of the cross validation method is employed for noisy boundary data cases.Numerical results for two benchmark problems show that the boundary knot method is simple,accurate,stable and computationally efficient for inverse problems under domains with doubly connected domains.
文摘Two new regularization algorithms for solving the first-kind Volterra integral equation, which describes the pressure-rate deconvolution problem in well test data interpretation, are developed in this paper. The main features of the problem are the strong nonuniform scale of the solution and large errors (up to 15%) in the input data. In both algorithms, the solution is represented as decomposition on special basic functions, which satisfy given a priori information on solution, and this idea allow us significantly to improve the quality of approximate solution and simplify solving the minimization problem. The theoretical details of the algorithms, as well as the results of numerical experiments for proving robustness of the algorithms, are presented.
基金supported in part by the National Natural Science Foundation of China(Nos.61905112 and 62073161)in part by the China Scholarship Council(Nos.201906830092)in part by the Fundamental Research Funds for the Central University(No.NZ2020005)。
文摘This research develops an accurate and efficient method for the Perspective-n-Line(Pn L)problem. The developed method addresses and solves Pn L via exploiting the problem’s geometry in a non-linear least squares fashion. Specifically, by representing the rotation matrix with a novel quaternion parameterization, the Pn L problem is first decomposed into four independent subproblems. Then, each subproblem is reformulated as an unconstrained minimization problem, in which the Kronecker product is adopted to write the cost function in a more compact form. Finally, the Groobner basis technique is used to solve the polynomial system derived from the first-order optimality conditions of the cost function. Moreover, a novel strategy is presented to improve the efficiency of the algorithm. It is improved by exploiting structure information embedded in the rotation parameterization to accelerate the computing of coefficient matrix of a cost function. Experiments on synthetic data and real images show that the developed method is comparable to or better than state-of-the-art methods in accuracy, but with reduced computational requirements.
基金The authors sincerely acknowledge the financial support from the National Science Foundation of China(No.12002240)the National Science and Technology Major Project(No.2017-IV-0003-0040).
文摘An improved interpolating complex variable element-frees Galerkin(IICVEFG)method for the two-dimensional elastic problems is developed.This method is based on the improved interpolating complex variable moving least-squares(IICVMLS)method and the integral form of the elastic problems.In the IICVEFG method,the proposed shape function has the interpolating feature.Therefore,the essential boundary conditions can be exerted directly.Additionally,the unnecessary t erms in the discrete mat rices are removed,which resul ts in a set of concise formulas.This method is verified by analyzing three elastic examples under different constraints and loads.The numerical results show that the IICVEFG method is superior in precision and efficiency to other non-interpolating meshless methods.
文摘A local meshless method is applied to find the numerical solutions of two classes of inverse problems in parabolic equations. The problem is reconstructing the source term using a solution specified at some internal points;one class is that the source term is time dependent, and the other class is that the source term is time and space dependent. Some numerical experiments are presented and discussed.
基金supported by the National Natural Science Foundation of China(Nos.11701253,11971259,11801216)Natural Science Foundation of Shandong Province(No.ZR2017BA010)。
文摘In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of this paper.Firstly,we establish a scheme to approximate the optimality system by using the finite volume element method in the physical space and the meshfree method in the probability space,which is competitive for high-dimensional random inputs.Secondly,the a priori error estimates are derived for the state,the co-state and the control variables.Some numerical tests are carried out to confirm the theoretical results and demonstrate the efficiency of the proposed method.
基金the National Natural Science Foundation of China (Nos.11571238,11601332,91130014,11471312 and 91430216).
文摘Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.
基金supported by a grant from the Major State Basic Research Development Program of China (973 Program) (2013CB338002)
文摘To optimize the algorithms for the dihedral hidden subgroup problem,we present a new algorithm based on lattice basis reduction algorithm.For n\120,we reduce the dihedral hidden subgroup problem to shortest vector problem.A subroutine is given to get a transition quantum state by constructing a phase filter function,and then the measurement basis are derived based on the lattice basis reduction algorithm for solving low density subset sum problem.Finally,the parity of slope s is revealed by the measurement.This algorithm needs preparing mn quantum states,m qubits to store and O(n2)classical space,which is superior to existing algorithms.
基金Supported by National Natural Science Foundation of China (Grant No. 10971086)Mathematical Tianyuan Foundation of China (Grant No. 11126186)+1 种基金Natural Science Foundation of Gansu Province (Grant No.1107RJZA218)Fundamental Research Funds for Central Universities (Grant No. lzujbky-2012-12)
文摘Let X＊ be a free monoid over an alphabet X and W be a finite language over X. Let S（W） be the Rees quotient X＊/I（W）, where I（W） is the ideal of X＊ consisting of all elements of X＊ that are not subwords of W. Then S（W） is a finite monoid with zero and is called the discrete syntactic monoid of W. W is called finitely based if the monoid S（W） is finitely based. In this paper, we give some sufficient conditions for a monoid to be non-finitely based. Using these conditions and other results, we describe all finitely based 2-limited words over a three-element alphabet. Furthermore, an explicit algorithm is given to decide that whether or not a 2-limited word in which there are exactly two non-linear letters is finitely based.
