Conjugate Gradient Algorithm for the Symmetric Arrowhead Solution of Matrix Equation AXB=C
Based on the conjugate gradient (CG) algorithm, the constrained matrix equation AXB=C and the associate optimal approximation problem are considered for the symmetric arrowhead matrix solutions in the premise of consistency. The convergence results of the method are presented. At last, a numerical example is given to illustrate the efficiency of this method.
Implementation of ADETRAN Language Using Message Passing Interface
This paper describes the Message Passing Interface
(MPI) implementation of ADETRAN language, and its evaluation
on SX-ACE supercomputers. ADETRAN language includes pdo
statement that specifies the data distribution and parallel computations
and pass statement that specifies the redistribution of arrays. Two
methods for implementation of pass statement are discussed and the
performance evaluation using Splitting-Up CG method is presented.
The effectiveness of the parallelization is evaluated and the advantage
of one dimensional distribution is empirically confirmed by using the
results of experiments.
An Iterative Method for the Symmetric Arrowhead Solution of Matrix Equation
In this paper, according to the classical algorithm
LSQR for solving the least-squares problem, an iterative method is
proposed for least-squares solution of constrained matrix equation. By
using the Kronecker product, the matrix-form LSQR is presented to
obtain the like-minimum norm and minimum norm solutions in a
constrained matrix set for the symmetric arrowhead matrices. Finally,
numerical examples are also given to investigate the performance.
On the Positive Definite Solutions of Nonlinear Matrix Equation
In this paper, the nonlinear matrix equation is investigated. Based on the fixed-point theory, the boundary and the existence of the solution with the case r>-δi are discussed. An algorithm that avoids matrix inversion with the case -1<-δi<0 is proposed.
On Constructing a Cubically Convergent Numerical Method for Multiple Roots
We propose the numerical method defined by
xn+1 = xn − λ[f(xn − μh(xn))/]f'(xn) , n ∈ N,
and determine the control parameter λ and μ to converge cubically. In addition, we derive the asymptotic error constant. Applying this proposed scheme to various test functions, numerical results show a good agreement with the theory analyzed in this paper and are proven using Mathematica with its high-precision computability.
New High Order Group Iterative Schemes in the Solution of Poisson Equation
We investigate the formulation and implementation of new explicit group iterative methods in solving the two-dimensional Poisson equation with Dirichlet boundary conditions. The methods are derived from a fourth order compact nine point finite difference discretization. The methods are compared with the existing second order standard five point formula to show the dramatic improvement in computed accuracy. Numerical experiments are presented to illustrate the effectiveness of the proposed methods.
Positive Solutions of Initial Value Problem for the Systems of Second Order Integro-Differential Equations in Banach Space
In this paper, by establishing a new comparison result, we investigate the existence of positive solutions for initial value problems of nonlinear systems of second order integro-differential equations in Banach space.We improve and generalize some results (see[5,6]), and the results is new even in finite dimensional spaces.
Automatic Iterative Methods for the Multivariate Solution of Nonlinear Algebraic Equations
Most real world systems express themselves formally
as a set of nonlinear algebraic equations. As applications grow, the
size and complexity of these equations also increase. In this work, we
highlight the key concepts in using the homotopy analysis method
as a methodology used to construct efficient iteration formulas for
nonlinear equations solving. The proposed method is experimentally
characterized according to a set of determined parameters which
affect the systems. The experimental results show the potential and
limitations of the new method and imply directions for future work.
Semiconvergence of Alternating Iterative Methods for Singular Linear Systems
In this paper, we discuss semiconvergence of the alternating iterative methods for solving singular systems. The semiconvergence theories for the alternating methods are established when the coefficient matrix is a singular matrix. Furthermore, the corresponding comparison theorems are obtained.
Two-Dimensional Solitary Wave Solution to the Quadratic Nonlinear Schrdinger Equation
The solitary wave solution of the quadratic nonlinear Schrdinger equation is determined by the iterative method called Petviashvili method. This solution is also used for the initial condition for the time evolution to study the stability analysis. The spectral method is applied for the time evolution.
New Laguerre-s Type Method for Solving of a Polynomial Equations Systems
In this paper we present a substantiation of a new
Laguerre-s type iterative method for solving of a nonlinear
polynomial equations systems with real coefficients. The problems of
its implementation, including relating to the structural choice of
initial approximations, were considered. Test examples demonstrate
the effectiveness of the method at the solving of many practical
An Iterative Algorithm to Compute the Generalized Inverse A(2) T,S Under the Restricted Inner Product
Let T and S be a subspace of Cn and Cm, respectively.
Then for A ∈ Cm×n satisfied AT ⊕ S = Cm, the generalized
T,S is given by A(2)
T,S = (PS⊥APT )†. In this paper, a
finite formulae is presented to compute generalized inverse A(2)
under the concept of restricted inner product, which defined as <
A,B >T,S=< PS⊥APT,B > for the A,B ∈ Cm×n. By this
iterative method, when taken the initial matrix X0 = PTA∗PS⊥, the
generalized inverse A(2)
T,S can be obtained within at most mn iteration
steps in absence of roundoff errors. Finally given numerical example
is shown that the iterative formulae is quite efficient.
Solving a System of Nonlinear Functional Equations Using Revised New Iterative Method
In the present paper, we present a modification of the
New Iterative Method (NIM) proposed by Daftardar-Gejji and Jafari
[J. Math. Anal. Appl. 2006;316:753–763] and use it for solving
systems of nonlinear functional equations. This modification yields
a series with faster convergence. Illustrative examples are presented
to demonstrate the method.
New Newton's Method with Third-order Convergence for Solving Nonlinear Equations
For the last years, the variants of the Newton-s method with cubic convergence have become popular iterative methods to find approximate solutions to the roots of non-linear equations. These methods both enjoy cubic convergence at simple roots and do not require the evaluation of second order derivatives. In this paper, we present a new Newton-s method based on contra harmonic mean with cubically convergent. Numerical examples show that the new method can compete with the classical Newton's method.
Two Fourth-order Iterative Methods Based on Continued Fraction for Root-finding Problems
In this paper, we present two new one-step iterative
methods based on Thiele-s continued fraction for solving nonlinear
equations. By applying the truncated Thiele-s continued fraction
twice, the iterative methods are obtained respectively. Analysis of
convergence shows that the new methods are fourth-order convergent.
Numerical tests verifying the theory are given and based on the
methods, two new one-step iterations are developed.
Note to the Global GMRES for Solving the Matrix Equation AXB = F
In the present work, we propose a new projection method for solving the matrix equation AXB = F. For implementing our new method, generalized forms of block Krylov subspace and global Arnoldi process are presented. The new method can be considered as an extended form of the well-known global generalized minimum residual (Gl-GMRES) method for solving multiple linear systems and it will be called as the extended Gl-GMRES (EGl- GMRES). Some new theoretical results have been established for proposed method by employing Schur complement. Finally, some numerical results are given to illustrate the efficiency of our new method.
Gauss-Seidel Iterative Methods for Rank Deficient Least Squares Problems
We study the semiconvergence of Gauss-Seidel iterative
methods for the least squares solution of minimal norm of rank
deficient linear systems of equations. Necessary and sufficient conditions
for the semiconvergence of the Gauss-Seidel iterative method
are given. We also show that if the linear system of equations is
consistent, then the proposed methods with a zero vector as an initial
guess converge in one iteration. Some numerical results are given to
illustrate the theoretical results.
A Projection Method Based on Extended Krylov Subspaces for Solving Sylvester Equations
In this paper we study numerical methods for solving Sylvester matrix equations of the form AX +XBT +CDT = 0. A new projection method is proposed. The union of Krylov subspaces in A and its inverse and the union of Krylov subspaces in B and its inverse are used as the right and left projection subspaces, respectively. The Arnoldi-like process for constructing the orthonormal basis of the projection subspaces is outlined. We show that the approximate solution is an exact solution of a perturbed Sylvester matrix equation. Moreover, exact expression for the norm of residual is derived and results on finite termination and convergence are presented. Some numerical examples are presented to illustrate the effectiveness of the proposed method.
Iterative Methods for An Inverse Problem
An inverse problem of doubly center matrices is discussed. By translating the constrained problem into unconstrained problem, two iterative methods are proposed. A numerical example illustrate our algorithms.
Iterative Methods for Computing the Weighted Minkowski Inverses of Matrices in Minkowski Space
In this note, we consider a family of iterative formula for computing the weighted Minskowski inverses AM,N in Minskowski space, and give two kinds of iterations and the necessary and sufficient conditions of the convergence of iterations.
Preconditioned Mixed-Type Splitting Iterative Method For Z-Matrices
In this paper, we present the preconditioned mixed-type
splitting iterative method for solving the linear systems, Ax = b,
where A is a Z-matrix. And we give some comparison theorems
to show that the convergence rate of the preconditioned mixed-type
splitting iterative method is faster than that of the mixed-type splitting
iterative method. Finally, we give a numerical example to illustrate
Extending Global Full Orthogonalization method for Solving the Matrix Equation AXB=F
In the present work, we propose a new method for
solving the matrix equation AXB=F . The new method can
be considered as a generalized form of the well-known global full
orthogonalization method (Gl-FOM) for solving multiple linear
systems. Hence, the method will be called extended Gl-FOM (EGl-
FOM). For implementing EGl-FOM, generalized forms of block
Krylov subspace and global Arnoldi process are presented. Finally,
some numerical experiments are given to illustrate the efficiency of
our new method.
On the Solution of Fully Fuzzy Linear Systems
A linear system is called a fully fuzzy linear system (FFLS) if quantities in this system are all fuzzy numbers. For the FFLS, we investigate its solution and develop a new approximate method for solving the FFLS. Observing the numerical results, we find that our method is accurate than the iterative Jacobi and Gauss- Seidel methods on approximating the solution of FFLS.
Parallel Multisplitting Methods for Singular Linear Systems
In this paper, we discuss convergence of the extrapolated iterative methods for linear systems with the coefficient matrices are singular H-matrices. And we present the sufficient and necessary conditions for convergence of the extrapolated iterative methods. Moreover, we apply the results to the GMAOR methods. Finally, we give one numerical example.
A New Preconditioned AOR Method for Z-matrices
In this paper, we present a preconditioned AOR-type iterative method for solving the linear systems Ax = b, where A is a Z-matrix. And give some comparison theorems to show that the rate of convergence of the preconditioned AOR-type iterative method is faster than the rate of convergence of the AOR-type iterative method.
A New Derivative-Free Quasi-Secant Algorithm For Solving Non-Linear Equations
Most of the nonlinear equation solvers do not converge always or they use the derivatives of the function to approximate the
root of such equations. Here, we give a derivative-free algorithm that guarantees the convergence. The proposed two-step method, which
is to some extent like the secant method, is accompanied with some
numerical examples. The illustrative instances manifest that the rate of convergence in proposed algorithm is more than the quadratically
The Approximate Solution of Linear Fuzzy Fredholm Integral Equations of the Second Kind by Using Iterative Interpolation
in this paper, we propose a numerical method
for the approximate solution of fuzzy Fredholm functional
integral equations of the second kind by using an iterative
interpolation. For this purpose, we convert the linear fuzzy
Fredholm integral equations to a crisp linear system of integral
equations. The proposed method is illustrated by some fuzzy
integral equations in numerical examples.
Numerical Study of Iterative Methods for the Solution of the Dirichlet-Neumann Map for Linear Elliptic PDEs on Regular Polygon Domains
A generalized Dirichlet to Neumann map is
one of the main aspects characterizing a recently introduced
method for analyzing linear elliptic PDEs, through which it
became possible to couple known and unknown components
of the solution on the boundary of the domain without
solving on its interior. For its numerical solution, a well conditioned
quadratically convergent sine-Collocation method
was developed, which yielded a linear system of equations
with the diagonal blocks of its associated coefficient matrix
being point diagonal. This structural property, among others,
initiated interest for the employment of iterative methods for
its solution. In this work we present a conclusive numerical
study for the behavior of classical (Jacobi and Gauss-Seidel)
and Krylov subspace (GMRES and Bi-CGSTAB) iterative
methods when they are applied for the solution of the Dirichlet
to Neumann map associated with the Laplace-s equation
on regular polygons with the same boundary conditions on
A New Iterative Method for Solving Nonlinear Equations
In this study, a new root-finding method for solving nonlinear equations is proposed. This method requires two starting values that do not necessarily bracketing a root. However, when the starting values are selected to be close to a root, the proposed method converges to the root quicker than the secant method. Another advantage over all iterative methods is that; the proposed method usually converges to two distinct roots when the given function has more than one root, that is, the odd iterations of this new technique converge to a root and the even iterations converge to another root. Some numerical examples, including a sine-polynomial equation, are solved by using the proposed method and compared with results obtained by the secant method; perfect agreements are found.