636 results
Search Results
2. Convergence analysis of sample average approximation for a class of stochastic nonlinear complementarity problems: from two-stage to multistage
- Author
-
Hailin Sun, Bin Zhou, and Jie Jiang
- Subjects
Original Paper ,Class (set theory) ,Applied Mathematics ,Numerical analysis ,Two-stage ,010103 numerical & computational mathematics ,90C33 ,Multistage ,Lipschitz continuity ,Stochastic complementarity problems ,01 natural sciences ,90C15 ,010101 applied mathematics ,Convergence analysis ,Sample average approximation ,Theory of computation ,Convergence (routing) ,Nonlinear complementarity ,Applied mathematics ,Stage (hydrology) ,0101 mathematics ,Mathematics - Abstract
In this paper, we consider the sample average approximation (SAA) approach for a class of stochastic nonlinear complementarity problems (SNCPs) and study the corresponding convergence properties. We first investigate the convergence of the SAA counterparts of two-stage SNCPs when the first-stage problem is continuously differentiable and the second-stage problem is locally Lipschitz continuous. After that, we extend the convergence results to a class of multistage SNCPs whose decision variable of each stage is influenced only by the decision variables of adjacent stages. Finally, some preliminary numerical tests are presented to illustrate the convergence results.
- Published
- 2020
3. Numerical methods for static shallow shells lying over an obstacle
- Author
-
Paolo Piersanti, Xiaoqin Shen, City University of Hong Kong (CityU), and Xi'an Jiaotong University (Xjtu)
- Subjects
Original Paper ,Applied Mathematics ,Numerical analysis ,Mathematical analysis ,010103 numerical & computational mathematics ,Bilinear form ,Half-space ,Obstacle problems · Elliptic variational inequalities ,01 natural sciences ,Finite element method ,010101 applied mathematics ,Elliptic variational inequalities ,Non-conforming finite element method ,Enriching operator ,Obstacle problems ,Shallow shell ,Obstacle ,Theory of computation ,Convergence (routing) ,Obstacle problem ,0101 mathematics ,Nonconforming finite element method ,[MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA] ,Mathematics - Abstract
In this paper a finite element analysis to approximate the solution of an obstacle problem for a static shallow shell confined in a half space is presented. First, we rigorously prove some estimates for a suitable enriching operator connecting Morley's triangle to Hsieh-Clough-Tocher triangle. Secondly, we establish an estimate for the approximate bilinear form associated with the problem under consideration. Finally, we conduct an error analysis and we prove the convergence of the proposed numerical scheme.
- Published
- 2020
- Full Text
- View/download PDF
4. Waveform relaxation of partial differential equations
- Author
-
Zhen Miao and Yao-Lin Jiang
- Subjects
Partial differential equation ,Applied Mathematics ,Numerical analysis ,Short paper ,Relaxation (iterative method) ,010103 numerical & computational mathematics ,01 natural sciences ,010101 applied mathematics ,Theory of computation ,Convergence (routing) ,Applied mathematics ,Waveform ,0101 mathematics ,Energy (signal processing) ,Mathematics - Abstract
This short paper concludes a general waveform relaxation (WR) method at the PDE level for semi-linear reaction-diffusion equations. For the case of multiple coupled PDE(s), new Jacobi WR and Gauss-Seidel WR are provided to accelerate the convergence result of classical WR. The convergence conditions are proved based on energy estimate. Numerical experiments are demonstrated with several WR methods in parallel to verify the effectiveness of the general WR method.
- Published
- 2018
5. Complex moment-based methods for differential eigenvalue problems
- Author
-
Imakura, Akira, Morikuni, Keiichi, and Takayasu, Akitoshi
- Subjects
Applied Mathematics ,FOS: Mathematics ,Mathematics - Numerical Analysis ,Numerical Analysis (math.NA) - Abstract
This paper considers computing partial eigenpairs of differential eigenvalue problems (DEPs) such that eigenvalues are in a certain region on the complex plane. Recently, based on a "solve-then-discretize" paradigm, an operator analogue of the FEAST method has been proposed for DEPs without discretization of the coefficient operators. Compared to conventional "discretize-then-solve" approaches that discretize the operators and solve the resulting matrix problem, the operator analogue of FEAST exhibits much higher accuracy; however, it involves solving a large number of ordinary differential equations (ODEs). In this paper, to reduce the computational costs, we propose operation analogues of Sakurai-Sugiura-type complex moment-based eigensolvers for DEPs using higher-order complex moments and analyze the error bound of the proposed methods. We show that the number of ODEs to be solved can be reduced by a factor of the degree of complex moments without degrading accuracy, which is verified by numerical results. Numerical results demonstrate that the proposed methods are over five times faster compared with the operator analogue of FEAST for several DEPs while maintaining almost the same high accuracy. This study is expected to promote the "solve-then-discretize" paradigm for solving DEPs and contribute to faster and more accurate solutions in real-world applications., Comment: 26 pages, 9 figures
- Published
- 2022
6. A class of C2 quasi-interpolating splines free of Gibbs phenomenon
- Author
-
Sergio Amat, David Levin, Juan Ruiz-Álvarez, Juan C. Trillo, Dionisio F. Yáñez, Universidad Politécnica de Cartagena, and Universidad de Valencia
- Subjects
Splines ,Computer aided design (modeling of curves) ,12 Matemáticas ,C2 regularity ,Applied Mathematics ,MathematicsofComputing_NUMERICALANALYSIS ,Matemática Aplicada ,Adaption to discontinuities ,Quasi-interpolation ,ComputingMethodologies_COMPUTERGRAPHICS - Abstract
In many applications, it is useful to use piecewise polynomials that satisfy certain regularity conditions at the joint points. Cubic spline functions emerge as good candidates having C2 regularity. On the other hand, if the data points present discontinuities, the classical spline approximations produce Gibbs oscillations. In a recent paper, we have introduced a new nonlinear spline approximation avoiding the presence of these oscillations. Unfortunately, this new reconstruction loses the C2 regularity. This paper introduces a new nonlinear spline that preserves the regularity at all the joint points except at the end points of an interval containing a discontinuity, and that avoids the Gibbs oscillations. Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. This work was funded by the Programa de Apoyo a la investigación de la fundación Séneca-Agencia de Ciencia y Tecnología de la Región de Murcia 20928/PI/18, by the national research project MMTM2015-64382-P and PID2019-108336GB-I00 (MINECO/FEDER), by grant MTM2017-83942 funded by Spanish MINECO and by grant PID2020-117211GB-I00 funded by MCIN/AEI/10.13039/501100011033.
- Published
- 2022
7. Optimal convergence of three iterative methods based on nonconforming finite element discretization for 2D/3D MHD equations
- Author
-
Haiyan Su, Zhilin Li, and Jiali Xu
- Subjects
Piecewise linear function ,Nonlinear system ,Discretization ,Iterative method ,Applied Mathematics ,Numerical analysis ,Convergence (routing) ,Applied mathematics ,Stability (probability) ,Finite element method ,Mathematics::Numerical Analysis ,Mathematics - Abstract
The main purpose of this paper is to analyze nonconforming iterative finite element methods for 2D/3D stationary incompressible magneto-hydrodynamics equations. First, the Crouzeix-Raviart–type finite element is used to approximate the velocity and the conforming piecewise linear element P1 is used for the pressure. Since the finite element method for the velocity field and the pressure is unstable, a simple locally stabilization term is added to satisfy the weak inf-sup condition. Then, the well-posedness and the optimal error estimates of the continuous and discrete problems are analyzed with the nonlinear terms being iteratively updated. Three effective iterative methods are proposed and their stability and convergence analyses are carried out. Finally, the theoretical analysis presented in this paper is verified by numerical experiments.
- Published
- 2021
8. On the best achievable quality of limit points of augmented Lagrangian schemes
- Author
-
Gabriel Haeser, Roberto Andreani, Leonardo D. Secchin, Alberto Ramos, and Leonardo M. Mito
- Subjects
Constraint (information theory) ,Mathematical optimization ,Augmented Lagrangian method ,Applied Mathematics ,Numerical analysis ,media_common.quotation_subject ,Theory of computation ,Convergence (routing) ,Limit point ,Quality (business) ,Algebra over a field ,Mathematics ,media_common - Abstract
The optimization literature is vast in papers dealing with improvements on the global convergence of augmented Lagrangian schemes. Usually, the results are based on weak constraint qualifications, or, more recently, on sequential optimality conditions obtained via penalization techniques. In this paper, we propose a somewhat different approach, in the sense that the algorithm itself is used in order to formulate a new optimality condition satisfied by its feasible limit points. With this tool at hand, we present several new properties and insights on limit points of augmented Lagrangian schemes, in particular, characterizing the strongest possible global convergence result for the safeguarded augmented Lagrangian method.
- Published
- 2021
9. A Tseng extragradient method for solving variational inequality problems in Banach spaces
- Author
-
H. A. Abass, A. A. Mebawondu, Olawale Kazeem Oyewole, and K. O. Aremu
- Subjects
Sequence ,Applied Mathematics ,Numerical analysis ,Variational inequality ,Convergence (routing) ,Banach space ,Applied mathematics ,Lipschitz continuity ,Constant (mathematics) ,Projection (linear algebra) ,Mathematics - Abstract
This paper presents an inertial Tseng extragradient method for approximating a solution of the variational inequality problem. The proposed method uses a single projection onto a half space which can be easily evaluated. The method considered in this paper does not require the knowledge of the Lipschitz constant as it uses variable stepsizes from step to step which are updated over each iteration by a simple calculation. We prove a strong convergence theorem of the sequence generated by this method to a solution of the variational inequality problem in the framework of a 2-uniformly convex Banach space which is also uniformly smooth. Furthermore, we report some numerical experiments to illustrate the performance of this method. Our result extends and unifies corresponding results in this direction in the literature.
- Published
- 2021
10. A matrix-less method to approximate the spectrum and the spectral function of Toeplitz matrices with real eigenvalues
- Author
-
Sven-Erik Ekström and P. Vassalos
- Subjects
Beräkningsmatematik ,Applied Mathematics ,010102 general mathematics ,Generating function ,Order (ring theory) ,Asymptotic expansion ,Spectral analysis ,Numerical Analysis (math.NA) ,010103 numerical & computational mathematics ,Function (mathematics) ,Type (model theory) ,01 natural sciences ,Toeplitz matrix ,Combinatorics ,Computational Mathematics ,Matrix (mathematics) ,Toeplitz matrices ,FOS: Mathematics ,Mathematics - Numerical Analysis ,0101 mathematics ,Structured matrices ,Eigenvalues and eigenvectors ,Mathematics - Abstract
It is known that the generating function f of a sequence of Toeplitz matrices {Tn(f)}n may not describe the asymptotic distribution of the eigenvalues of Tn(f) if f is not real. In this paper, we assume as a working hypothesis that, if the eigenvalues of Tn(f) are real for all n, then they admit an asymptotic expansion of the same type as considered in previous works, where the first function, called the eigenvalue symbol $\mathfrak {f}$ f , appearing in this expansion is real and describes the asymptotic distribution of the eigenvalues of Tn(f). This eigenvalue symbol $\mathfrak {f}$ f is in general not known in closed form. After validating this working hypothesis through a number of numerical experiments, we propose a matrix-less algorithm in order to approximate the eigenvalue distribution function $\mathfrak {f}$ f . The proposed algorithm, which opposed to previous versions, does not need any information about neither f nor $\mathfrak {f}$ f is tested on a wide range of numerical examples; in some cases, we are even able to find the analytical expression of $\mathfrak {f}$ f . Future research directions are outlined at the end of the paper.
- Published
- 2021
11. Stability analysis of the method of fundamental solutions with smooth closed pseudo-boundaries for Laplace’s equation: better pseudo-boundaries
- Author
-
Li-Ping Zhang, Zi-Cai Li, Ming-Gong Lee, and Hung-Tsai Huang
- Subjects
Laplace's equation ,Polynomial ,Laplace transform ,Applied Mathematics ,Numerical analysis ,010103 numerical & computational mathematics ,01 natural sciences ,010101 applied mathematics ,Bounded function ,Applied mathematics ,Method of fundamental solutions ,0101 mathematics ,Condition number ,Circulant matrix ,Mathematics - Abstract
Consider Laplace’s equation in a bounded simply-connected domain S, and use the method of fundamental solutions (MFS). The error and stability analysis is made for circular/elliptic pseudo-boundaries in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020), and polynomial convergence rates and exponential growth rates of the condition number (Cond) are obtained. General pseudo-boundaries are suggested for more complicated solution domains in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020, Section 5). Since the ill-conditioning is severe, the success in computation by the MFS mainly depends on stability. This paper is devoted to stability analysis for smooth closed pseudo-boundaries of source nodes. Bounds of the Cond are derived, and exponential growth rates are also obtained. This paper is the first time to explore stability analysis of the MFS for non-circular/non-elliptic pseudo-boundaries. Circulant matrices are often employed for stability analysis of the MFS; but the stability analysis in this paper is explored based on new techniques without using circulant matrices as in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020). To pursue better pseudo-boundaries, the sensitivity index is proposed from growth/convergence rates of stability via accuracy. Better pseudo-boundaries in the MFS can be found by trial computations, to develop the study in Dou et al. (J. Comp. Appl. Math. 377:112861, 2020) for the selection of pseudo-boundaries. For highly smooth and singular solutions, better pseudo-boundaries are different; an analysis of the sensitivity index is explored. Circular/elliptic pseudo-boundaries are optimal for highly smooth solutions, but not for singular solutions. In this paper, amoeba-like domains are chosen in computation. Several useful types of pseudo-boundaries are developed and their algorithms are simple without using nonlinear solutions. For singular solutions, numerical comparisons are made for different pseudo-boundaries via the sensitivity index.
- Published
- 2021
12. Numerical study on Moore-Penrose inverse of tensors via Einstein product
- Author
-
Baohua Huang
- Subjects
Applied Mathematics ,Numerical analysis ,Inverse ,Space (mathematics) ,General Relativity and Quantum Cosmology ,symbols.namesake ,Product (mathematics) ,Conjugate gradient method ,symbols ,Tensor ,Einstein ,Moore–Penrose pseudoinverse ,Mathematical physics ,Mathematics - Abstract
The notation of Moore-Penrose inverse of matrices has been extended from matrix space to even-order tensor space with Einstein product. In this paper, we give the numerical study on the Moore-Penrose inverse of tensors via the Einstein product. More precisely, we transform the calculation of Moore-Penrose inverse of tensors via the Einstein product into solving a class of tensor equations via the Einstein product. Then, by means of the conjugate gradient method, we obtain the approximate Moore-Penrose inverse of tensors via the Einstein product. Finally, we report some numerical examples to show the efficiency of the proposed methods and testify the conclusion suggested in this paper.
- Published
- 2021
13. Weak Galerkin finite element methods with or without stabilizers
- Author
-
Xiaoshen Wang, Xiu Ye, and Shangyou Zhang
- Subjects
010101 applied mathematics ,Applied Mathematics ,Numerical analysis ,Convergence (routing) ,Theory of computation ,Applied mathematics ,010103 numerical & computational mathematics ,0101 mathematics ,Algebra over a field ,Galerkin method ,01 natural sciences ,Finite element method ,Mathematics - Abstract
The purpose of this paper is to investigate the connections between the weak Galerkin (WG) methods with and without stabilizers. The choices of stabilizers directly affect the convergence rates of the corresponding WG methods in general. However, we observed that the convergence rates are independent of the choices of stabilizers for these WG elements with stabilizers being optional. In this paper, we will verify such phenomena theoretically as well as numerically.
- Published
- 2021
14. Highly efficient schemes for time-fractional Allen-Cahn equation using extended SAV approach
- Author
-
Chuanju Xu, Hongyi Zhu, Dianming Hou, Institut de Mécanique et d'Ingénierie (I2M), Université de Bordeaux (UB)-Institut Polytechnique de Bordeaux-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)-Arts et Métiers Sciences et Technologies, and HESAM Université (HESAM)-HESAM Université (HESAM)
- Subjects
Discretization ,Applied Mathematics ,Numerical analysis ,Scalar (physics) ,Numerical Analysis (math.NA) ,010103 numerical & computational mathematics ,01 natural sciences ,Stability (probability) ,[SPI.MAT]Engineering Sciences [physics]/Materials ,010101 applied mathematics ,Nonlinear system ,Theory of computation ,FOS: Mathematics ,Order (group theory) ,Applied mathematics ,Mathematics - Numerical Analysis ,0101 mathematics ,Allen–Cahn equation ,Mathematics - Abstract
In this paper, we propose and analyze high-order efficient schemes for the time-fractional Allen-Cahn equation. The proposed schemes are based on the L1 discretization for the time-fractional derivative and the extended scalar auxiliary variable (SAV) approach developed very recently to deal with the nonlinear terms in the equation. The main contributions of the paper consist of (1) constructing first- and higher order unconditionally stable schemes for different mesh types, and proving the unconditional stability of the constructed schemes for the uniform mesh; (2) carrying out numerical experiments to verify the efficiency of the schemes and to investigate the coarsening dynamics governed by the time-fractional Allen-Cahn equation. In particular, the influence of the fractional order on the coarsening behavior is carefully examined. Our numerical evidence shows that the proposed schemes are more robust than the existing methods, and their efficiency is less restricted to particular forms of the nonlinear potentials.
- Published
- 2021
15. Centrality measures for node-weighted networks via line graphs and the matrix exponential
- Author
-
Mona Matar, Lothar Reichel, and Omar De la Cruz Cabrera
- Subjects
Discrete mathematics ,Applied Mathematics ,Node (networking) ,Directed graph ,law.invention ,law ,Matrix function ,Theory of computation ,Line graph ,Adjacency matrix ,Matrix exponential ,Centrality ,MathematicsofComputing_DISCRETEMATHEMATICS ,Mathematics - Abstract
This paper is concerned with the identification of important nodes in node-weighted graphs by applying matrix functions, in particular the matrix exponential. Many tools that use an adjacency matrix for a graph have been developed to study the importance of the nodes in unweighted or edge-weighted networks. However, adjacency matrices for node-weighted graphs have not received much attention. The present paper proposes using a line graph associated with a node-weighted graph to construct an edge-weighted graph that can be analyzed with available methods. Both undirected and directed graphs with positive node weights are considered. We show that when the weight of a node increases, the importance of this node in the graph increases as well, provided that the adjacency matrix is suitably scaled. Applications to real-life problems are presented.
- Published
- 2021
16. Tensor extrapolation methods with applications
- Author
-
Rachid Sadaka, Khalide Jbilou, Fatemeh Panjeh Ali Beik, and A. El Ichi
- Subjects
Sequence ,Applied Mathematics ,Numerical analysis ,Theory of computation ,Singular value decomposition ,Extrapolation ,Applied mathematics ,Tensor ,Algebra over a field ,Mathematics ,Matrix polynomial - Abstract
In this paper, we mainly develop the well-known vector and matrix polynomial extrapolation methods in tensor framework. To this end, some new products between tensors are defined and the concept of positive definitiveness is extended for tensors corresponding to T-product. Furthermore, we discuss on the solution of least-squares problem associated with a tensor equation using Tensor Singular Value Decomposition (TSVD). Motivated by the effectiveness of some proposed vector extrapolation methods in earlier papers, we describe how an extrapolation technique can be also implemented on the sequence of tensors produced by truncated TSVD (TTSVD) for solving possibly ill-posed tensor equations.
- Published
- 2020
17. A nonnegativity preserving algorithm for multilinear systems with nonsingular ${\mathcal M}$-tensors
- Author
-
Hongjin He, Guanglu Zhou, Chen Ling, and Xueli Bai
- Subjects
Sequence ,Multilinear map ,Applied Mathematics ,Numerical analysis ,MathematicsofComputing_NUMERICALANALYSIS ,010103 numerical & computational mathematics ,System of linear equations ,01 natural sciences ,law.invention ,010101 applied mathematics ,Invertible matrix ,law ,TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY ,ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION ,Theory of computation ,Tensor ,0101 mathematics ,Algorithm ,Mathematics ,Numerical partial differential equations - Abstract
This paper addresses multilinear systems of equations which arise in various applications such as data mining and numerical partial differential equations. When the multilinear system under consideration involves a nonsingular ${\mathscr{M}}$ -tensor and a nonnegative right-hand side vector, it may have multiple nonnegative solutions. In this paper, we propose an algorithm which can always preserve the nonnegativity of solutions. Theoretically, we show that the sequence generated by the proposed algorithm is a nonnegative componentwise nonincreasing sequence and converges to a nonnegative solution of the system. Numerical results further support the novelty of the proposed method.
- Published
- 2020
18. On the split common fixed point problem for strict quasi-ϕ-pseudocontractive mappings in Banach spaces
- Author
-
Xindong Liu, Zili Chen, and Jinxing Liu
- Subjects
Sequence ,Pure mathematics ,Iterative method ,Applied Mathematics ,Numerical analysis ,Theory of computation ,Banach space ,Common fixed point ,Null point ,Algebra over a field ,Mathematics - Abstract
The purpose of this paper is to propose an algorithm for solving the split common fixed point problem for strict quasi-ϕ-pseudocontractive mappings in Banach spaces. It is proved that the sequence generated by the proposed iterative algorithm converges strongly to a solution of the split common fixed point problem. Then, the main result is used to study the split common null point problem and the split quasi-inclusion problem. Finally, a numerical example is provided to illustrate our main result. The results presented in this paper extend and improve some recent corresponding results.
- Published
- 2020
19. An implicit-explicit preconditioned direct method for pricing options under regime-switching tempered fractional partial differential models
- Author
-
Xu Chen, Wenfei Wang, Siu-Long Lei, and Deng Ding
- Subjects
Partial differential equation ,Direct sum ,Applied Mathematics ,Direct method ,Numerical analysis ,010103 numerical & computational mathematics ,01 natural sciences ,Toeplitz matrix ,010101 applied mathematics ,Valuation of options ,Applied mathematics ,Partial derivative ,0101 mathematics ,Coefficient matrix ,Mathematics - Abstract
Recently, fractional partial differential equations have been widely applied in option pricing problems, which better explains many important empirical facts of financial markets, but rare paper considers the multi-state options pricing problem based on fractional diffusion models. Thus, multi-state European option pricing problem under regime-switching tempered fractional partial differential equation is considered in this paper. Due to the expensive computational cost caused by the implicit finite difference scheme, a novel implicit-explicit finite difference scheme has been developed with consistency, stability, and convergence guarantee. Since the resulting coefficient matrix equals to the direct sum of several Toeplitz matrices, a preconditioned direct method has been proposed with ${\mathcal O}(\bar {S}N\log N+\bar {S}^{2} N)$ operation cost on each time level with adaptability analysis, where $\bar {S}$ is the number of states and N is the number of grid points. Related numerical experiments including an empirical example have been presented to demonstrate the effectiveness and accuracy of the proposed numerical method.
- Published
- 2020
20. Analysis of optimal superconvergence of the local discontinuous Galerkin method for nonlinear fourth-order boundary value problems
- Author
-
Mahboub Baccouch
- Subjects
Degree (graph theory) ,Discontinuous Galerkin method ,Applied Mathematics ,Order (ring theory) ,Applied mathematics ,Boundary value problem ,Superconvergence ,Type (model theory) ,Finite element method ,Prime (order theory) ,Mathematics::Numerical Analysis ,Mathematics - Abstract
This paper is concerned with the convergence and superconvergence of the local discontinuous Galerkin (LDG) finite element method for nonlinear fourth-order boundary value problems of the type $u^{(4)}=f(x,u,u^{\prime },u^{\prime \prime },u^{\prime \prime \prime })$ , x ∈ [a,b] with classical boundary conditions at the endpoints. Convergence properties for the solution and for all three auxiliary variables are established. More specifically, we use the duality argument to prove that the errors between the LDG solutions and the exact solutions in the L2 norm achieve optimal (p + 1)th-order convergence, when polynomials of degree p are used. We also prove that the derivatives of the errors between the LDG solutions and Gauss-Radau projections of the exact solutions in the L2 norm are superconvergent with order p + 1. Furthermore, a (2p + 1)th-order superconvergent for the errors of the numerical fluxes at mesh nodes as well as for the cell averages is also obtained under quasi-uniform meshes. Finally, we prove that the LDG solutions are superconvergent with an order of p + 2 toward particular projections of the exact solutions. The error analysis presented in this paper is valid for p ≥ 1. Numerical experiments indicate that our theoretical findings are optimal.
- Published
- 2020
21. Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- Author
-
Huanchang Huang, Xiao Liu, Min Yang, Yunong Zhang, and Yihong Ling
- Subjects
Discretization ,Truncation error (numerical integration) ,Applied Mathematics ,Numerical analysis ,010103 numerical & computational mathematics ,Function (mathematics) ,01 natural sciences ,010101 applied mathematics ,Matrix (mathematics) ,Transpose ,Convergence (routing) ,Applied mathematics ,0101 mathematics ,Mathematics ,Variable (mathematics) - Abstract
Zeroing dynamics (ZD) has shown great performance to solve various time-varying problems. In this paper, the problem of time-varying Sylvester-transpose matrix inequality is first investigated. Since it is difficult to solve a matrix inequality with a matrix variable and its transpose by traditional methods, this paper proposes a continuous ZD (CZD) model by employing ZD design formula and JMP function array to solve this challenging problem. Furthermore, for better implementation on digital computers, three discrete ZD (DZD) models are proposed by using three different discretization formulas with different precision, i.e., the Euler-forward formula, the 6-instant Zhang et al discretization (ZeaD) formula and the 7-instant ZeaD formula. What is more, theoretical truncation error analyses and numerical experiments substantiate the convergence, efficacy and superiority of the DZD models for solving time-varying Sylvester-transpose matrix inequality.
- Published
- 2020
22. Newton’s method with fractional derivatives and various iteration processes via visual analysis
- Author
-
Krzysztof Gdawiec, Agnieszka Lisowska, and Wiesław Kotarski
- Subjects
Polynomial ,Applied Mathematics ,Numerical analysis ,Stability (learning theory) ,Fractional derivative ,01 natural sciences ,Fractional calculus ,010101 applied mathematics ,symbols.namesake ,Newton method ,Fixed-point iteration ,ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION ,0103 physical sciences ,Convergence (routing) ,symbols ,Polynomiography ,Applied mathematics ,Iterations ,0101 mathematics ,010301 acoustics ,Complex plane ,Newton's method ,Mathematics - Abstract
The aim of this paper is to visually investigate the dynamics and stability of the process in which the classic derivative is replaced by the fractional Riemann–Liouville or Caputo derivatives in the standard Newton root-finding method. Additionally, instead of the standard Picard iteration, the Mann, Khan, Ishikawa and S iterations are used. This process when applied to polynomials on complex plane produces images showing basins of attractions for polynomial zeros or images representing the number of iterations required to achieve any polynomial root. The images are called polynomiographs. In this paper, we use the colouring according to the number of iterations which reveals the speed of convergence and dynamic properties of processes visualised by polynomiographs. Moreover, to investigate the stability of the methods, we use basins of attraction. To compare numerically the modified root-finding methods among them, we demonstrate their action for polynomialz3− 1 on a complex plane.
- Published
- 2020
23. On equivalence of three-parameter iterative methods for singular symmetric saddle-point problem
- Author
-
M. Tzoumas and Apostolos Hadjidimos
- Subjects
Iterative method ,Applied Mathematics ,Numerical analysis ,010103 numerical & computational mathematics ,Symmetric case ,01 natural sciences ,law.invention ,010101 applied mathematics ,Invertible matrix ,law ,Saddle point ,Theory of computation ,Applied mathematics ,0101 mathematics ,Equivalence (measure theory) ,Saddle ,Mathematics - Abstract
There have been a couple of papers for the solution of the nonsingular symmetric saddle-point problem using three-parameter iterative methods. In most of them, regions of convergence for the parameters are found, while in three of them, optimal parameters are determined, and in one of the latter, many more cases, than in all the others, are distinguished, analyzed, and studied. It turns out that two of the optimal parameters coincide making the optimal three-parameter methods be equivalent to the optimal two-parameter known ones. Our aim in this work is manifold: (i) to show that the iterative methods we present are equivalent, (ii) to slightly change some statements in one of the main papers, (iii) to complete the analysis in another one, (iv) to explain how the transition from any of the methods to the others is made, (v) to extend the iterative method to cover the singular symmetric case, and (vi) to present a number of numerical examples in support of our theory. It would be an omission not to mention that the main material which all researchers in the area have inspired from and used is based on the one of the most cited papers by Bai et al. (Numer. Math. 102:1–38, 2005).
- Published
- 2020
24. Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces
- Author
-
Oluwatosin Temitope Mewomo, Timilehin Opeyemi Alakoya, and Adeolu Taiwo
- Subjects
Iterative and incremental development ,Applied Mathematics ,Regular polygon ,Banach space ,010103 numerical & computational mathematics ,Type (model theory) ,01 natural sciences ,010101 applied mathematics ,Monotone polygon ,Corollary ,Theory of computation ,Convergence (routing) ,Applied mathematics ,0101 mathematics ,Mathematics - Abstract
In this paper, we study the split common fixed point and monotone variational inclusion problem in uniformly convex and 2-uniformly smooth Banach spaces. We propose a Halpern-type algorithm with two self-adaptive stepsizes for obtaining solution of the problem and prove strong convergence theorem for the algorithm. Many existing results in literature are derived as corollary to our main result. In addition, we apply our main result to split common minimization problem and fixed point problem and illustrate the efficiency and performance of our algorithm with a numerical example. The main result in this paper extends and generalizes many recent related results in the literature in this direction.
- Published
- 2020
25. Superconvergence in H1-norm of a difference finite element method for the heat equation in a 3D spatial domain with almost-uniform mesh
- Author
-
Ruijian He, Zhangxin Chen, and Xinlong Feng
- Subjects
Backward differentiation formula ,Computational complexity theory ,Applied Mathematics ,Numerical analysis ,Mathematical analysis ,010103 numerical & computational mathematics ,Superconvergence ,01 natural sciences ,Finite element method ,010101 applied mathematics ,Norm (mathematics) ,Bounded function ,Heat equation ,0101 mathematics ,Mathematics - Abstract
In this paper, we propose a novel difference finite element (DFE) method based on the P1-element for the 3D heat equation on a 3D bounded domain. One of the novel ideas of this paper is to use the second-order backward difference formula (BDF) combining DFE method to overcome the computational complexity of conventional finite element (FE) method for the high-dimensional parabolic problem. First, we design a fully discrete difference FE solution ${u^{n}_{h}}$ by the second-order backward difference formula in the temporal t-direction, the center difference scheme in the spatial z-direction, and the P1-element on a almost-uniform mesh Jh in the spatial (x, y)-direction. Next, the H1-stability of ${u_{h}^{n}}$ and the second-order H1-convergence of the interpolation post-processing function on ${u_{h}^{n}}$ with respect to u(tn) are provided. Finally, numerical tests are presented to show the second-order H1-convergence results of the proposed DFE method for the heat equation in a 3D spatial domain.
- Published
- 2020
26. Analysis and application of the interpolating element-free Galerkin method for extended Fisher–Kolmogorov equation which arises in brain tumor dynamics modeling
- Author
-
Mohammad Ilati
- Subjects
Partial differential equation ,Applied Mathematics ,Numerical analysis ,Finite difference ,010103 numerical & computational mathematics ,01 natural sciences ,010101 applied mathematics ,Nonlinear system ,Convergence (routing) ,Biharmonic equation ,Fisher–Kolmogorov equation ,Applied mathematics ,0101 mathematics ,Galerkin method ,Mathematics - Abstract
In this paper, the interpolating element-free Galerkin method is applied for solving the nonlinear biharmonic extended Fisher–Kolmogorov equation which arises in brain tumor dynamics modeling. At first, a finite difference formula is utilized for obtaining a time-discrete scheme. The unconditional stability and convergence of the time-discrete method are proved by the energy method. Then, we use the interpolating element-free Galerkin method to approximate the spatial derivatives. An error analysis of the interpolating element-free Galerkin method is proposed for this nonlinear equation. Moreover, this method is compared with some other meshless local weak-form techniques. The main aim of this paper is to show that the interpolating element-free Galerkin is a suitable technique for solving the nonlinear fourth-order partial differential equations especially extended Fisher–Kolmogorov equation. The numerical experiments confirm the analytical results and show the good efficiency of the interpolating element-free Galerkin method for solving this nonlinear biharmonic equation.
- Published
- 2019
27. Multiscale radial kernels with high-order generalized Strang-Fix conditions
- Author
-
Wenwu Gao and Xuan Zhou
- Subjects
Polynomial ,Applied Mathematics ,Numerical analysis ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,010103 numerical & computational mathematics ,Function (mathematics) ,01 natural sciences ,Convolution ,010101 applied mathematics ,Moment (mathematics) ,Linear form ,Theory of computation ,Applied mathematics ,0101 mathematics ,ComputingMethodologies_COMPUTERGRAPHICS ,Variable (mathematics) ,Mathematics - Abstract
The paper provides a general and simple approach for explicitly constructing multiscale radial kernels with high-order generalized Strang-Fix conditions from a given univariate generator. The resulting kernels are constructed by taking a linear functional to the scaled f -form of the generator with respect to the scale variable. Equivalent divided difference forms of the kernels are also derived; based on which, a pyramid-like algorithm for fast and stable computation of multiscale radial kernels is proposed. In addition, characterizations of the kernels in both the spatial and frequency domains are given, which show that the generalized Strang-Fix condition, the moment condition, and the condition of polynomial reproduction in the convolution sense are equivalent to each other. Hence, as a byproduct, the paper provides a unified view of these three classical concepts. These kernels can be used to construct quasi-interpolation with high approximation accuracy and construct convolution operators with high approximation orders, to name a few. As an example, we construct a quasi-interpolation scheme for irregularly spaced data and derived its error estimates and choices of scale parameters of multiscale radial kernels. Numerical results of approximating a bivariate Franke function using our quasi-interpolation are presented at the end of the paper. Both theoretical and numerical results show that quasi-interpolation with multiscale radial kernels satisfying high-order generalized Strang-Fix conditions usually provides high approximation orders.
- Published
- 2019
28. An adaptive local discontinuous Galerkin method for nonlinear two-point boundary-value problems
- Author
-
Mahboub Baccouch
- Subjects
Discretization ,Adaptive mesh refinement ,Applied Mathematics ,Estimator ,010103 numerical & computational mathematics ,Superconvergence ,01 natural sciences ,Prime (order theory) ,010101 applied mathematics ,Rate of convergence ,Discontinuous Galerkin method ,Applied mathematics ,Boundary value problem ,0101 mathematics ,Mathematics - Abstract
In this paper, we propose an adaptive mesh refinement (AMR) strategy based on a posteriori error estimates for the local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form $u^{\prime \prime }=f(x,u),\ x\in [a,b]$ subject to some suitable boundary conditions at the endpoint of the interval [a, b]. We first use the superconvergence results proved in the first part of this paper as reported by Baccouch (Numer. Algorithm. 79(3), 697–718 2018) to show that the significant parts of the local discretization errors are proportional to (p + 1)-degree Radau polynomials, when polynomials of total degree not exceeding p are used. These new results allow us to construct a residual-based a posteriori error estimators which are obtained by solving a local residual problem with no boundary conditions on each element. The proposed error estimates are efficient, reliable, and asymptotically exact. We prove that, for smooth solutions, the proposed a posteriori error estimates converge to the exact errors in the L2-norm with order of convergence p + 3/2. Finally, we present a local AMR procedure that makes use of our local and global a posteriori error estimates. Our proofs are valid for arbitrary regular meshes and for Pp polynomials with p ≥ 1. Several numerical results are presented to validate the theoretical results and to show the efficiency of the grid refinement strategy.
- Published
- 2019
29. Estimating the trace of matrix functions with application to complex networks
- Author
-
Rafael Díaz Fuentes, Marco Donatelli, Caterina Fenu, and Giorgio Mantica
- Subjects
Applied Mathematics - Abstract
The approximation of trace(f(Ω)), where f is a function of a symmetric matrix Ω, can be challenging when Ω is exceedingly large. In such a case even the partial Lanczos decomposition of Ω is computationally demanding and the stochastic method investigated by Bai et al. (J. Comput. Appl. Math. 74:71–89, 1996) is preferred. Moreover, in the last years, a partial global Lanczos method has been shown to reduce CPU time with respect to partial Lanczos decomposition. In this paper we review these techniques, treating them under the unifying theory of measure theory and Gaussian integration. This allows generalizing the stochastic approach, proposing a block version that collects a set of random vectors in a rectangular matrix, in a similar fashion to the partial global Lanczos method. We show that the results of this technique converge quickly to the same approximation provided by Bai et al. (J. Comput. Appl. Math. 74:71–89, 1996), while the block approach can leverage the same computational advantages as the partial global Lanczos. Numerical results for the computation of the Von Neumann entropy of complex networks prove the robustness and efficiency of the proposed block stochastic method.
- Published
- 2022
30. Drift-implicit Euler scheme for sandwiched processes driven by Hölder noises
- Author
-
Giulia Di Nunno, Yuliya Mishura, and Anton Yurchenko-Tytarenko
- Subjects
60H10, 60H35, 60G22, 91G30 ,Applied Mathematics ,Probability (math.PR) ,FOS: Mathematics - Abstract
In this paper, we analyze the drift-implicit (or backward) Euler numerical scheme for a class of stochastic differential equations with unbounded drift driven by an arbitrary $λ$-Hölder continuous process, $λ\in(0,1)$. We prove that, under some mild moment assumptions on the Hölder constant of the noise, the $L^r(Ω;L^\infty([0,T]))$-rate of convergence is equal to $λ$. To exemplify, we consider numerical schemes for the generalized Cox--Ingersoll-Ross and Tsallis--Stariolo--Borland models. The results are illustrated by simulations., 24 pages, 3 figures
- Published
- 2022
31. Solution of ill-posed problems with Chebfun
- Author
-
A. Alqahtani, T. Mach, and L. Reichel
- Subjects
Applied Mathematics - Abstract
The analysis of linear ill-posed problems often is carried out in function spaces using tools from functional analysis. However, the numerical solution of these problems typically is computed by first discretizing the problem and then applying tools from finite-dimensional linear algebra. The present paper explores the feasibility of applying the Chebfun package to solve ill-posed problems with a regularize-first approach numerically. This allows a user to work with functions instead of vectors and with integral operators instead of matrices. The solution process therefore is much closer to the analysis of ill-posed problems than standard linear algebra-based solution methods. Furthermore, the difficult process of explicitly choosing a suitable discretization is not required.
- Published
- 2022
32. A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum
- Author
-
Zhi Zhao, Teng-Teng Yao, Zheng-Jian Bai, and Xiao-Qing Jin
- Subjects
Applied Mathematics ,FOS: Mathematics ,Numerical Analysis (math.NA) ,Mathematics::Differential Geometry ,Mathematics - Numerical Analysis ,15A18, 65F08, 65F18, 65F15 - Abstract
This paper is concerned with the inverse problem of constructing a symmetric nonnegative matrix from realizable spectrum. We reformulate the inverse problem as an underdetermined nonlinear matrix equation over a Riemannian product manifold. To solve it, we develop a Riemannian underdetermined inexact Newton dogleg method for solving a general underdetermined nonlinear equation defined between Riemannian manifolds and Euclidean spaces. The global and quadratic convergence of the proposed method is established under some mild assumptions. Then we solve the inverse problem by applying the proposed method to its equivalent nonlinear matrix equation and a preconditioner for the perturbed normal Riemannian Newton equation is also constructed. Numerical tests show the efficiency of the proposed method for solving the inverse problem., 32 pages, 6 figures
- Published
- 2022
33. Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Author
-
Zhou Sheng, Gonglin Yuan, and Xiaoliang Wang
- Subjects
Trust region ,Line search ,Applied Mathematics ,Numerical analysis ,Structure (category theory) ,010103 numerical & computational mathematics ,01 natural sciences ,010101 applied mathematics ,Simple (abstract algebra) ,Conjugate gradient method ,Convergence (routing) ,Theory of computation ,0101 mathematics ,Algorithm ,Mathematics - Abstract
It is well-known that conjugate gradient algorithms are widely applied in many practical fields, for instance, engineering problems and finance models, as they are straightforward and characterized by a simple structure and low storage. However, challenging problems remain, such as the convergence of the PRP algorithms for nonconvexity under an inexact line search, obtaining a sufficient descent for all conjugate gradient methods, and other theory properties regarding global convergence and the trust region feature for nonconvex functions. This paper studies family conjugate gradient formulas based on the six classic formulas, PRP, HS, CD, FR, LS, and DY, where the family conjugate gradient algorithms have better theory properties than those of the formulas by themselves. Furthermore, this technique of the presented conjugate gradient formulas can be extended to any two-term conjugate gradient formula. This paper designs family conjugate gradient algorithms for nonconvex functions, which have the following features without other conditions: (i) the sufficient descent property holds, (ii) the trust region feature is true, and (iii) the global convergence holds under normal assumptions. Numerical results show that the given conjugate gradient algorithms are competitive with those of normal methods.
- Published
- 2019
34. Reconstruction algorithms of an inverse source problem for the Helmholtz equation
- Author
-
Ji-Chuan Liu and Xiao-Chen Li
- Subjects
Nonlinear system ,Helmholtz equation ,Salient ,Applied Mathematics ,Numerical analysis ,Theory of computation ,ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION ,Boundary (topology) ,Cauchy distribution ,Algorithm ,Regularization (mathematics) ,Mathematics - Abstract
In this paper, we study an inverse source problem for the Helmholtz equation from measurements. The purpose of this paper is to reconstruct the salient features of the hidden sources within a body. We propose three stable reconstruction algorithms to detect the number, the location, the size, and the shape of the hidden sources along with compact support from a single measurement of near-field Cauchy data on the external boundary. This problem is nonlinear and ill-posed; thus, we should consider regularization techniques in reconstruction algorithms. We give several numerical experiments to demonstrate the viability of our proposed reconstruction algorithms.
- Published
- 2019
35. On the Gauss-Kronrod quadrature formula for a modified weight function of Chebyshev type
- Author
-
Ramón Orive, Aleksandar V. Pejčev, Miodrag M. Spalević, and Ljubica Mihić
- Subjects
Applied Mathematics - Abstract
In this paper, we consider the Gauss-Kronrod quadrature formulas for a modified Chebyshev weight. Efficient estimates of the error of these Gauss–Kronrod formulae for analytic functions are obtained, using techniques of contour integration that were introduced by Gautschi and Varga (cf. Gautschi and Varga SIAM J. Numer. Anal. 20, 1170–1186 1983). Some illustrative numerical examples which show both the accuracy of the Gauss–Kronrod formulas and the sharpness of our estimations are displayed. Though for the sake of brevity we restrict ourselves to the first kind Chebyshev weight, a similar analysis may be carried out for the other three Chebyshev type weights; part of the corresponding computations are included in a final appendix.
- Published
- 2022
36. Interval methods of Adams-Bashforth type with variable step sizes
- Author
-
Andrzej Marciniak and Malgorzata A. Jankowska
- Subjects
Applied Mathematics ,Numerical analysis ,010103 numerical & computational mathematics ,01 natural sciences ,010101 applied mathematics ,Exact solutions in general relativity ,Theory of computation ,Initial value problem ,Interval (graph theory) ,Applied mathematics ,0101 mathematics ,Constant (mathematics) ,Mathematics ,Variable (mathematics) ,Linear multistep method - Abstract
In a number of our previous papers, we have proposed interval versions of multistep methods (explicit and implicit), including interval predictor-corrector methods, in which the step size was constant. In this paper, we present interval versions of Adams-Bashforth methods with a possibility to change step sizes. This possibility can be used to obtain interval enclosures of the exact solution with a width given beforehand.
- Published
- 2019
37. Split-step cubic B-spline collocation methods for nonlinear Schrödinger equations in one, two, and three dimensions with Neumann boundary conditions
- Author
-
Luming Zhang and Shanshan Wang
- Subjects
Nonlinear system ,symbols.namesake ,Collocation ,Applied Mathematics ,B-spline ,Numerical analysis ,Neumann boundary condition ,symbols ,Finite difference ,Applied mathematics ,Nonlinear Schrödinger equation ,Schrödinger equation ,Mathematics - Abstract
In this paper, split-step cubic B-spline collocation (SS3BC) schemes are constructed by combining the split-step approach with the cubic B-spline collocation (3BC) method for the nonlinear Schrodinger (NLS) equation in one, two, and three dimensions with Neumann boundary conditions. Unfortunately, neither of the advantages of the two methods can be maintained for the multi-dimensional problems, if one combines them in the usual manner. For overcoming the difficulty, new medium quantities are introduced in this paper to successfully reduce the multi-dimensional problems into one-dimensional ones, which are essential for the SS3BC methods. Numerical tests are carried out, and the schemes are verified to be convergent with second-order both in time and space. The proposed method is also compared with the split-step finite difference (SSFD) scheme. Finally, the present method is applied to two problems of the Bose-Einstein condensate. The proposed SS3BC method is numerically verified to be effective and feasible.
- Published
- 2019
38. A priori error estimates of a Jacobi spectral method for nonlinear systems of fractional boundary value problems and related Volterra-Fredholm integral equations with smooth solutions
- Author
-
Mahmoud A. Zaky and Ibrahem G. Ameen
- Subjects
Nonlinear system ,Collocation ,Rate of convergence ,Applied Mathematics ,Numerical analysis ,Applied mathematics ,Interval (mathematics) ,Boundary value problem ,Spectral method ,Integral equation ,Mathematics - Abstract
Our aim in this paper is to develop a Legendre-Jacobi collocation approach for a nonlinear system of two-point boundary value problems with derivative orders at most two on the interval (0,T). The scheme is constructed based on the reduction of the system considered to its equivalent system of Volterra-Fredholm integral equations. The spectral rate of convergence for the proposed method is established in both L2- and $ L^{\infty } $- norms. The resulting spectral method is capable of achieving spectral accuracy for problems with smooth solutions and a reasonable order of convergence for non-smooth solutions. Moreover, the scheme is easy to implement numerically. The applicability of the method is demonstrated on a variety of problems of varying complexity. To the best of our knowledge, the spectral solution of such a nonlinear system of fractional differential equations and its associated nonlinear system of Volterra-Fredholm integral equations has not yet been studied in literature in detail. This gap in the literature is filled by the present paper.
- Published
- 2019
39. A Matlab software for approximate solution of 2D elliptic problems by means of the meshless Monte Carlo random walk method
- Author
-
Sławomir Milewski
- Subjects
Discretization ,business.industry ,Applied Mathematics ,Numerical analysis ,Monte Carlo method ,010103 numerical & computational mathematics ,System of linear equations ,Random walk ,01 natural sciences ,010101 applied mathematics ,Software ,Applied mathematics ,Meshfree methods ,Boundary value problem ,0101 mathematics ,business ,Mathematics - Abstract
This paper is devoted to the development of an innovative Matlab software, dedicated to the numerical analysis of two-dimensional elliptic problems, by means of the probabilistic approach. This approach combines features of the Monte Carlo random walk method with discretization and approximation techniques, typical for meshless methods. It allows for determination of an approximate solution of elliptic equations at the specified point (or group of points), without a necessity to generate large system of equations for the entire problem domain. While the procedure is simple and fast, the final solution may suffer from both stochastic and discretization errors. The attached Matlab software is based on several original author’s concepts. It permits the use of arbitrarily irregular clouds of nodes, non-homogeneous right-hand side functions, mixed type of boundary conditions as well as variable material coefficients (of anisotropic materials). The paper is illustrated with results of analysis of selected elliptic problems, obtained by means of this software.
- Published
- 2019
40. Unconditional optimal error estimate of the projection/Lagrange-Galerkin finite element method for the Boussinesq equations
- Author
-
Zhiyong Si, Zhang Tong, and Yanfang Lei
- Subjects
Applied Mathematics ,Numerical analysis ,010103 numerical & computational mathematics ,01 natural sciences ,Term (time) ,010101 applied mathematics ,Error function ,Exact solutions in general relativity ,Convergence (routing) ,Projection method ,Applied mathematics ,0101 mathematics ,Constant (mathematics) ,Projection (set theory) ,Mathematics - Abstract
This paper provides an unconditional optimal convergence of a fractional-step method for solving the Boussinesq equations. In this method, the convection is treated by the Lagrange-Galerkin technique, whereas the diffusion and the incompressibility are treated by the projection method. There are lots of authors who worked on this method, and some authors gave the error estimate of this method. But, to our best knowledge, the error estimate for this method is under certain time-step restrictions. In this paper, we prove that the methods are stable almost unconditionally, i.e., when τ and h are smaller than a given constant. The basic idea of our analysis is splitting the error function into three terms, one term between the finite element solution and the projection, the other term between the projection and the time-discrete solution, the third term between the time-discrete solution and the exact solution, and giving the error estimates for each term respectively. Then, we obtain the optimal error estimates in L2 and H1-norm for the velocity and L2-norm for the pressure. In order to show the efficiency of our method, some numerical results are presented.
- Published
- 2019
41. Variable order and stepsize in general linear methods
- Author
-
Winston L. Sweatman, Saghir Ahmad, and John C. Butcher
- Subjects
Set (abstract data type) ,General linear methods ,Applied Mathematics ,Numerical analysis ,Theory of computation ,Ode ,Applied mathematics ,Estimator ,Heuristics ,Mathematics ,Variable (mathematics) - Abstract
This paper describes the implementation of a class of IRKS methods (Wright 2002). These GLM algorithms are practical with reliable error estimators (Butcher and Podhaisky, Appl. Numer. Math. 56, 345–357 2006). The current robust ODE solvers in variable stepsize as well as in variable-order mode are based upon heuristics. In this paper, we examine an optimisation approach, based on Euler-Lagrange theory (Butcher, IMA J. Numer. Anal. 6, 433–438 1986), (Butcher, Computing 44, 209–220 1990), to control the stepsize as well as the order and implement the GLMs in an efficient manner. A set of nonstiff to mildly stiff problems have been used to investigate this approach in fixed-order and variable-order modes.
- Published
- 2019
42. Energy-preserving trigonometrically fitted continuous stage Runge-Kutta-Nyström methods for oscillatory Hamiltonian systems
- Author
-
Jiyong Li and Yachao Gao
- Subjects
Runge–Kutta methods ,Applied Mathematics ,Numerical analysis ,Order (ring theory) ,Applied mathematics ,Initial value problem ,Prime (order theory) ,Symmetry (physics) ,Hamiltonian system ,Mathematics ,Separable space - Abstract
Recently, continuous-stage Runge-Kutta-Nystrom (CSRKN) methods for solving numerically second-order initial value problem $q^{\prime \prime }= f(q)$ have been proposed and developed by Tang and Zhang (Appl. Math. Comput. 323, 204–219, 2018). This problem is equivalent to a separable Hamiltonian system when f(q) = −∇U(q) with smooth function U(q). Symplecticity-preserving discretizations of this system were studied in that paper. However, as an important representation of the Hamiltonian system, energy preservation has not been studied. In addition, many Hamiltonian systems in practical applications often have oscillatory characteristics so we should design special algorithms adapted to this feature. In this paper, we propose and study energy-preserving trigonometrically fitted CSRKN methods for oscillatory Hamiltonian systems. We extend the theory of trigonometrical fitting to CSRKN methods and derive sufficient conditions for energy preservation. We also study the symmetry and stability of the methods. Two symmetric and energy-preserving trigonometrically fitted schemes of order two and four, respectively, are constructed. Some numerical experiments are provided to confirm the theoretical expectations.
- Published
- 2019
43. A numerical algorithm based on a new kind of tension B-spline function for solving Burgers-Huxley equation
- Author
-
Nastaran Alinia and Mohammad Zarebnia
- Subjects
Polynomial ,Tension (physics) ,Applied Mathematics ,Numerical analysis ,B-spline ,Convergence (routing) ,Hyperbolic function ,Function (mathematics) ,Trigonometry ,Algorithm ,Mathematics - Abstract
In this paper, a numerical algorithm based on a new kind of tension B-spline, named hyperbolic-trigonometric tension B-spline method, is applied for solving Burgers-Huxley equation. This method is generated over the space span {sin(tt),cos(tt),sinh(tt),cosh(tt),1,t,...,tn-?5},n =?5, where t is the tension parameter. Properties of it are the same in most of the properties of the usual polynomial B-splines and benefit from some other advantages, as well. Therefore, in this paper, we apply three methods consisting of trigonometric method, hyperbolic tension B-spline method, and our new hyperbolic-trigonometric tension B-spline method, to solve Burgers-Huxley equation. The convergence analysis is discussed. Then, we use some numerical examples to illustrate the accuracy and implementation of the proposed algorithm.
- Published
- 2019
44. Optimal parameter selections for a general Halpern iteration
- Author
-
Tao Wu, Songnian He, Themistocles M. Rassias, and Yeol Je Cho
- Subjects
Sequence ,Applied Mathematics ,Numerical analysis ,Hilbert space ,Field (mathematics) ,010103 numerical & computational mathematics ,Fixed point ,01 natural sciences ,010101 applied mathematics ,Combinatorics ,symbols.namesake ,Rate of convergence ,Variational inequality ,symbols ,0101 mathematics ,Real number ,Mathematics - Abstract
Let C be a closed affine subset of a real Hilbert space H and $T:C \rightarrow C$ be a nonexpansive mapping. In this paper, for any fixed u ∈ C, a general Halpern iteration process: $$\left\{\begin{array}{ll} x_{0} \in C,\\ x_{n + 1}=t_{n}u+(1-t_{n})Tx_{n},n\geq 0, \end{array}\right. $$ is considered for finding a fixed point of T nearest to u, where the parameter sequence {tn} is selected in the real number field, $\mathbb {R}$. The core problem to be addressed in this paper is to find the optimal parameter sequence so that this iteration process has the optimal convergence rate and to give some numerical results showing advantages of our algorithms. Also, we study the problem of selecting the optimal parameters for a general viscosity approximation method and apply the results obtained from this study to solve a class of variational inequalities.
- Published
- 2019
45. Trees and B-series
- Author
-
John C. Butcher
- Subjects
Algebra ,General linear methods ,Differential equation ,Applied Mathematics ,Numerical analysis ,Theory of computation ,Order (group theory) ,B series ,Term (logic) ,Mathematics ,Connection (mathematics) - Abstract
The connection between trees and differential equations was pointed out in the classic paper by Cayley (Phil. Mag. 13, 172–176 1857). Trees were also used in the work of Merson (1957), on the order of Runge–Kutta methods. The paper by Hairer and Wanner (Computing 13, 1–15 1974), where the term B-series was introduced, followed papers by the present author (Butcher J. Austral. Math. Soc. 3, 185–201 1963, Math. Comput. 26, 79–106 1972). The present paper will survey the use of trees in the formulation of B-series and illustrate the results by constructing and analysing some examples of general linear methods.
- Published
- 2018
46. A bias-compensated fractional order normalized least mean square algorithm with noisy inputs
- Author
-
Jianmei Shuai, Yiheng Wei, Weidi Yin, Songsong Cheng, and Yong Wang
- Subjects
Applied Mathematics ,Numerical analysis ,Stability (learning theory) ,010103 numerical & computational mathematics ,Variance (accounting) ,01 natural sciences ,Noise (electronics) ,010101 applied mathematics ,Least mean squares filter ,Convergence (routing) ,Theory of computation ,0101 mathematics ,Root-mean-square deviation ,Algorithm ,Mathematics - Abstract
This paper comes up with a stable bias-compensated fractional order normalized least mean square (BC-FONLMS) algorithm with noisy inputs. This kind of bias-compensated algorithm needs the estimation of input noise variance to avoid the bias caused by noisy inputs. Yet, existing algorithms either cause instability because of the method used to estimate input noise variance, or surmount the instability problems at the price of performance diminishment. This paper introduces fractional order calculus into LMS algorithm to be a new BC-FONLMS algorithm. Then, analyze the stability of the BC-FONLMS algorithm through probing the recursive equations of mean deviation (MD) and mean square deviation (MSD). On the basis of the stability analysis, methods to estimate input noise variance and to adjust step size are suggested to stabilize the algorithm and likewise to enhance the performance such as convergence speed and steady-state error. Numerical simulations are given at last, whose results show that the proposed BC-FONLMS algorithm performs well.
- Published
- 2018
47. Weighted and deflated global GMRES algorithms for solving large Sylvester matrix equations
- Author
-
Gang Wu, Najmeh Azizi Zadeh, and Azita Tajaddini
- Subjects
Sylvester matrix ,Applied Mathematics ,Numerical analysis ,Linear system ,MathematicsofComputing_NUMERICALANALYSIS ,010103 numerical & computational mathematics ,Krylov subspace ,Computer Science::Numerical Analysis ,01 natural sciences ,Generalized minimal residual method ,Mathematics::Numerical Analysis ,Weighting ,010101 applied mathematics ,Matrix (mathematics) ,ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION ,0101 mathematics ,Algorithm ,Eigenvalues and eigenvectors ,Mathematics - Abstract
The solution of a large-scale Sylvester matrix equation plays an important role in control and large scientific computations. In this paper, we are interested in the large Sylvester matrix equation with large dimensionA and small dimension B, and a popular approach is to use the global Krylov subspace method. In this paper, we propose three new algorithms for this problem. We first consider the global GMRES algorithm with weighting strategy, which can be viewed as a precondition method. We present three new schemes to update the weighting matrix during iterations. Due to the growth of memory requirements and computational cost, it is necessary to restart the algorithm effectively. The deflation strategy is efficient for the solution of large linear systems and large eigenvalue problems; to the best of our knowledge, little work is done on applying deflation to the (weighted) global GMRES algorithm for large Sylvester matrix equations. We then consider how to combine the weighting strategy with deflated restarting, and propose a weighted global GMRES algorithm with deflation for solving large Sylvester matrix equations. In particular, we are interested in the global GMRES algorithm with deflation, which can be viewed as a special case when the weighted matrix is chosen as the identity. Theoretical analysis is given to show rationality of the new algorithms. Numerical experiments illustrate the numerical behavior of the proposed algorithms.
- Published
- 2018
48. An efficient numerical method on modified space-time sparse grid for time-fractional diffusion equation with nonsmooth data
- Author
-
Bi-Yun Zhu, Xue-Yang Li, and Ai-Guo Xiao
- Subjects
Applied Mathematics - Abstract
In this paper, we focus on developing a high efficient algorithm for solving d-dimension time-fractional diffusion equation (TFDE). For TFDE, the initial function or source term is usually not smooth, which can lead to the low regularity of exact solution. And such low regularity have a marked impact on the convergence rate of numerical method. In order to improve the convergence rate of the algorithm, we introduce the space-time sparse grid (STSG) method to solve TFDE. In our study, we employ the sine basis for spatial discretization, and all the sine coefficients can be divided into several levels. The sine coefficients with different levels are discretized by temporal basis with different scales, which can lead to the STSG method. Under certain conditions, the function approximation on standard STSG can achieve the accuracy order O(2-Jd) with O(2JJ) degrees of freedom (DOF) for d=1 and O(2Jd) DOF for d>1, where J denotes the maximal level of sine coefficients. However, the standard STSG is not suitable to simulate the singularity of TFDE at the initial time. To overcome this, we integrate the full grid into the STSG, and obtain the modified STSG. Then, the modified STSG is used to construct the fully discrete scheme for solving TFDE. The great advantage of STSG method can be shown in the comparative numerical experiment.Mathematics Subject Classification (2010) 35R11 · 65M70 · 65T40 · 68Q25
- Published
- 2023
49. The behavior of the Gauss-Radau upper bound of the error norm in CG
- Author
-
Gérard Meurant and Petr Tichý
- Subjects
Applied Mathematics - Abstract
Consider the problem of solving systems of linear algebraic equations $$\varvec{A}\varvec{x}=\varvec{b}$$ A x = b with a real symmetric positive definite matrix $$\varvec{A}$$ A using the conjugate gradient (CG) method. To stop the algorithm at the appropriate moment, it is important to monitor the quality of the approximate solution. One of the most relevant quantities for measuring the quality of the approximate solution is the $$\varvec{A}$$ A -norm of the error. This quantity cannot be easily computed; however, it can be estimated. In this paper we discuss and analyze the behavior of the Gauss-Radau upper bound on the $$\varvec{A}$$ A -norm of the error, based on viewing CG as a procedure for approximating a certain Riemann-Stieltjes integral. This upper bound depends on a prescribed underestimate $$\varvec{\mu }$$ μ to the smallest eigenvalue of $$\varvec{A}$$ A . We concentrate on explaining a phenomenon observed during computations showing that, in later CG iterations, the upper bound loses its accuracy, and is almost independent of $$\varvec{\mu }$$ μ . We construct a model problem that is used to demonstrate and study the behavior of the upper bound in dependence of $$\varvec{\mu }$$ μ , and developed formulas that are helpful in understanding this behavior. We show that the above-mentioned phenomenon is closely related to the convergence of the smallest Ritz value to the smallest eigenvalue of $$\varvec{A}$$ A . It occurs when the smallest Ritz value is a better approximation to the smallest eigenvalue than the prescribed underestimate $$\varvec{\mu }$$ μ . We also suggest an adaptive strategy for improving the accuracy of the upper bounds in the previous iterations.
- Published
- 2023
50. An algebraically stabilized method for convection–diffusion–reaction problems with optimal experimental convergence rates on general meshes
- Author
-
Petr Knobloch
- Subjects
Applied Mathematics - Abstract
Algebraically stabilized finite element discretizations of scalar steady-state convection–diffusion–reaction equations often provide accurate approximate solutions satisfying the discrete maximum principle (DMP). However, it was observed that a deterioration of the accuracy and convergence rates may occur for some problems if meshes without local symmetries are used. The paper investigates these phenomena both numerically and analytically and the findings are used to design a new algebraic stabilization called Symmetrized Monotone Upwind-type Algebraically Stabilized (SMUAS) method. It is proved that the SMUAS method is linearity preserving and satisfies the DMP on arbitrary simplicial meshes. Moreover, numerical results indicate that the SMUAS method leads to optimal convergence rates on general simplicial meshes.
- Published
- 2023
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.