New iterative codes for identifying 𝓗 -tensor are obtained. As an application, some sufficient conditions of the positive definiteness for an even-order real symmetric tensor, i.e., an even-degree homogeneous polynomial form are given. Advantages of results obtained are illustrated by numerical examples.
A new method for computation of eigenvalues of the radial Schrödinger operator is presented. The potential is assumed to behave as if and as if . The Schrödinger equation is transformed to a non-linear differential equation of the first order for a function . It is shown that the eigenvalues are the discontinuity points of the function . Moreover, it is shown how to obtain an arbitrarily accurate approximation of eigenvalues. The method seems to be much more economical in comparison...
In this paper we introduce and analyze new mixed finite volume methods for second order elliptic problems which are based on H(div)-conforming approximations for the vector variable and discontinuous approximations for the scalar variable. The discretization is fulfilled by combining the ideas of the traditional finite volume box method and the local discontinuous Galerkin method. We propose two different types of methods, called Methods I and II, and show that they have distinct advantages over...
In this paper, we present a family of three-point with eight-order convergence methods for finding the simple roots of nonlinear equations by suitable approximations and weight function based on Maheshwari’s method. Per iteration this method requires three evaluations of the function and one evaluation of its first derivative. These class of methods have the efficiency index equal to [...] 814≈1.682. We describe the analysis of the proposed methods along with numerical experiments including comparison...
We propose a new Broyden method for solving systems of nonlinear equations, which uses the first derivatives, but is more efficient than the Newton method (measured by the computational time) for larger dense systems. The new method updates QR or LU decompositions of nonsymmetric approximations of the Jacobian matrix, so it requires arithmetic operations per iteration in contrast with the Newton method, which requires operations per iteration. Computational experiments confirm the high efficiency...
In this paper we are concerned with a distributed optimal control problem governed by an elliptic partial differential equation. State constraints of box type are considered. We show that the Lagrange multiplier associated with the state constraints, which is known to be a measure, is indeed more regular under quite general assumptions. We discretize the problem by continuous piecewise linear finite elements and we are able to prove that, for the case of a linear equation, the order of convergence...
We tackle the numerical simulation of reaction-diffusion equations modeling multi-scale reaction waves. This type of problems induces peculiar difficulties and potentially large stiffness which stem from the broad spectrum of temporal scales in the nonlinear chemical source term as well as from the presence of large spatial gradients in the reactive fronts, spatially very localized. A new resolution strategy was recently introduced ? that combines...
This paper presents a unified framework for the dual-weighted residual (DWR) method for a class of nonconforming FEM. Our approach is based on a modification of the dual problem and uses various ideas from literature which are combined in a new manner. The results are new error identities for some nonconforming FEM. Additionally, a posteriori error estimates with respect to the discrete -seminorm are derived.
We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems. We discuss convergence characteristics of the methods. Numerical experimentation results are included, illustrating the theoretical results and some other noteworthy properties of the Methods.
We provide new sufficient conditions for the convergence of the secant method to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses “Lipschitz-type” and center-“Lipschitz-type” instead of just “Lipschitz-type” conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than the earlier ones and under our convergence hypotheses we can cover cases where the earlier conditions are violated.
In this paper we test the feasibility of coupling two heterogeneous mathematical modeling integrated within two different codes residing on distant sites. A prototype is developed using Schwarz type domain decomposition as the mathematical tool for coupling. The computing technology for coupling uses a CORBA environment to implement a distributed client-server programming model. Domain decomposition methods are well suited to reducing complex physical phenomena into a sequence of parallel subproblems...