Further results on linear interval equations

As a continuation of my paper “New techniques for the analysis of linear interval equations” [Linear Algebra Appl. 58:273–325 (1984)], the interrelation between interval Gauss elimination and interval iteration is investigated. Main results are a new existence theorem for interval Gauss elimination (in the guise of a perturbation theorem), a convergence and comparison theorem for a general family of interval iteration schemes, and a new method for the calculation of the hull of the solution set of linear interval equations with inverse positive coefficient matrix.     

Solving Linear Systems Whose Elements Are Nonlinear Functions of Intervals

The paper addresses the problem of solving linear algebraic systems the elements of which are, in the general case, nonlinear functions of a given set of independent parameters taking on their values within prescribed intervals. Three kinds of solutions are considered: (i) outer solution, (ii) interval hull solution, and (iii) inner solution. A simple direct method for computing a tight outer solution to such systems is suggested. It reduces, essentially, to inverting a real matrix and solving a system of real linear equations whose size n is the size of the original system. The interval hull solution (which is a NP-hard problem) can be easily determined if certain monotonicity conditions are fulfilled. The resulting method involves solving n+1 interval outer solution problems as well as 2n real linear systems of size n. A simple iterative method for computing an inner solution is also given. A numerical example illustrating the applicability of the methods suggested is solved.     

Some experiments with interval methods for two-point boundary-value problems in ordinary differential equations

Methods of interval mathematics are used to find upper and lower bounds for the solution of two-point boundary-value problems at discrete mesh points. They include interval versions of shooting and of finite-difference techniques for linear and non-linear differential equations of second order, and of finite-difference methods for Sturm-Liouville eigenvalue problems.Good results are obtained whenever the difficulties of dependency-width can be avoided, and particularly for the finite-difference method when the associated matrix is anM matrix.     

一类区间数系数矩阵模糊线性方程组的迭代算法

讨论模糊线性方程组X=A-X+U解的存在条件及其迭代算法(其中,A-是区间数为元素的n阶矩阵,未知量X和常量U都是以模糊数为元素的n维向量,并且其加法和乘法均由Zadeh的扩张原理定义).首先研究解的存在条件,尔后探讨求解的迭代算法及误差估计.     

Chebyshev polynomial approximation for high‐order partial differential equations with complicated conditions

In this article, a new method is presented for the solution of high‐order linear partial differential equations (PDEs) with variable coefficients under the most general conditions. The method is based on the approximation by the truncated double Chebyshev series. PDE and conditions are transformed into the matrix equations, which corresponds to a system of linear algebraic equations with the unknown Chebyshev coefficients, via Chebyshev collocation points. Combining these matrix equations and then solving the system yields the Chebyshev coefficients of the solution function. Some numerical results are included to demonstrate the validity and applicability of the method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

An integral operational matrix based on Jacobi polynomials for solving fractional-order differential equations

This paper aims to construct a general formulation for the Jacobi operational matrix of fractional integral operator. Fractional calculus has been used to model physical and engineering processes that are found to be best described by fractional differential equations. Therefore, a reliable and efficient technique for the solution of them is too important. For the concept of fractional derivative we will adopt Caputo’s definition by using Riemann–Liouville fractional integral operator. Our main aim is to generalize the Jacobi integral operational matrix to the fractional calculus. These matrices together with the Tau method are then utilized to reduce the solution of this problem to the solution of a system of algebraic equations. The method is applied to solve linear and nonlinear fractional differential equations. Illustrative examples are included to demonstrate the validity and applicability of the presented technique.     

Systems of matrix rational differential equations arising in connection with linear stochastic systems with Markovian jumping

In this paper, a class of systems of matrix nonlinear differential equations containing as particular cases the systems of coupled Riccati differential equations arising in connection with control of some linear stochastic systems is considered.The system of differential equations considered in this paper are converted in a suitable nonlinear differential equation on a finite-dimensional Hilbert space adequately choosen.This allows us to use the positivity properties of the linear evolution operator defined by the linear differential equations of Lyapunov type.Our aim is to investigate properties of stabilizing and bounded solutions of the considered differential equations and to obtain some conditions ensuring the existence of such solutions.Conditions providing the existence of a maximal solution (minimal solution respectively) with respect to some classes of global solutions are presented. It is shown that if the coefficients of the equations are periodic functions all these special solutions (stabilizing, maximal, minimal) are periodic functions, too.Whenever possible the probabilistic arguments were avoided and so the results proved in the paper appear as results in the field of differential equations with interest in themselves.     

On the algebraic solution of fuzzy linear systems based on interval theory

In this paper, fuzzy linear systems involving a crisp square matrix and a fuzzy right-hand side vector are considered. A new approach to solve such systems based on interval theory and the new concept “interval inclusion linear system” is proposed. Also, new necessary and sufficient conditions are derived for obtaining the unique algebraic solution. Numerical examples are given to illustrate the efficiency of the proposed method.     

A Finite Algorithm for Almost Linear Complementarity Problems

We present an algorithm for solving a class of nonlinear complementarity problems called the almost linear complementarity problem (ALCP), which can be used to simulate free boundary problems. The algorithm makes use of a procedure for identifying an active index subset of an ALCP by bounding its solution with an interval vector. It is shown that an acceptable solution of the given ALCP can be obtained by solving at most n systems of equations. Numerical results are reported to illustrate the efficiency of the algorithm for large-scale problems.     

A Bernoulli polynomial approach with residual correction for solving mixed linear Fredholm integro-differential-difference equations

In this study, an approximate method based on Bernoulli polynomials and collocation points has been presented to obtain the solution of higher order linear Fredholm integro-differential-difference equations with the mixed conditions. The method we have used consists of reducing the problem to a matrix equation which corresponds to a system of linear algebraic equations. The obtained matrix equation is based on the matrix forms of Bernoulli polynomials and their derivatives by means of collocations. The solutions are obtained as the truncated Bernoulli series which are defined in the interval [a,b]. To illustrate the method, it is applied to the initial and boundary values. Also error analysis and numerical examples are included to demonstrate the validity and applicability of the technique.     

循环矩阵及其在结构计算中的应用

本文推广了循环矩阵的概念,讨论了它的一般性质,并提出了一种解系数矩阵为循环矩阵或准循环矩阵的线性代数方程组(这种方程组在一大类常见的结构物的计算中出现)的方法,这种解法比通常解法计算量小而且节省存储,同时还允许应用快速富氏变换以增怏其计算速度。     

Formal solution of an interval system of linear equations with an application in static responses of structures with interval forces

We are concerned with the so called formal solution of an interval system of linear equations. We focus on the case where the coefficient matrix is deterministic (real) and the right-hand side is an interval vector. We show that the set of formal solutions represents a convex polyhedral set. We propose new properties of the formal solution related to its existence, uniqueness and robustness. As particular classes of problems we investigate also the situation where the coefficient matrix is an M-matrix or H-matrix. Example problems related to the structures, such as 6-bar truss and a rectangular sheet, are solved to illustrate the computational aspects of the methods.     

Tikhonov solutions of approximately given systems of linear algebraic equations under finite perturbations of their matrices

The properties of a mathematical programming problem that arises in finding a stable (in the sense of Tikhonov) solution to a system of linear algebraic equations with an approximately given augmented coefficient matrix are examined. Conditions are obtained that determine whether this problem can be reduced to the minimization of a smoothing functional or to the minimal matrix correction of the underlying system of linear algebraic equations. A method for constructing (exact or approximately given) model systems of linear algebraic equations with known Tikhonov solutions is described. Sharp lower bounds are derived for the maximal error in the solution of an approximately given system of linear algebraic equations under finite perturbations of its coefficient matrix. Numerical examples are given.     

Diophantine Quadratic Equation and Smith Normal Form Using Scaled Extended Integer Abaffy–Broyden–Spedicato Algorithms

Classes of integer Abaffy–Broyden–Spedicato (ABS) methods have recently been introduced for solving linear systems of Diophantine equations. Each method provides the general integer solution of the system by computing an integer solution and an integer matrix, named Abaffian, with rows generating the integer null space of the coefficient matrix. The Smith normal form of a general rectangular integer matrix is a diagonal matrix, obtained by elementary nonsingular (unimodular) operations. Here, we present a class of algorithms for computing the Smith normal form of an integer matrix. In doing this, we propose new ideas to develop a new class of extended integer ABS algorithms generating an integer basis for the integer null space of the matrix. For the Smith normal form, having the need to solve the quadratic Diophantine equation, we present two algorithms for solving such equations. The first algorithm makes use of a special integer basis for the row space of the matrix, and the second one, with the intention of controlling the growth of intermediate results and making use of our given conjecture, is based on a recently proposed integer ABS algorithm. Finally, we report some numerical results on randomly generated test problems showing a better performance of the second algorithm in controlling the size of the solution. We also report the results obtained by our proposed algorithm on the Smith normal form and compare them with the ones obtained using Maple, observing a more balanced distribution of the intermediate components obtained by our algorithm.     

Numerical solution of a Fredholm integro-differential equation modelling neural networks

We compare piecewise linear and polynomial collocation approaches for the numerical solution of a Fredholm integro-differential equations modelling neural networks. Both approaches combine the use of Gaussian quadrature rules on an infinite interval of integration with interpolation to a uniformly distributed grid on a bounded interval. These methods are illustrated by numerical experiments on neural networks equations.     

Parametric continuation of the solitary traveling pulse solution in the reaction-diffusion system using the Newton-Krylov method

The matrix-free Newton-Krylov method that uses the GMRES algorithm (an iterative algorithm for solving systems of linear algebraic equations) is used for the parametric continuation of the solitary traveling pulse solution in a three-component reaction-diffusion system. Using the results of integration on a short time interval, we replace the original system of nonlinear algebraic equations by another system that has more convenient (from the viewpoint of the spectral properties of the GMRES algorithm) Jacobi matrix. The proposed parametric continuation proved to be efficient for large-scale problems, and it made it possible to thoroughly examine the dependence of localized solutions on a parameter of the model.     

Conservative and developing systems of linear equations

The paper considers some aspects of mathematical modeling of intensively developing socio-economic processes. A new interpretation of the concept of solution is suggested for classical (conservative) systems of linear equations. It is shown that the same variables change from equation to equation and have an interval solution.Poltava Cooperative Institute. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 67, pp. 134–141, 1989.     

Integrable hydrodynamic submodels with a linear velocity field

Invariant and partially invariant solutions to the equations of gas dynamics with a linear velocity field are defined by a matrix satisfying a homogeneous integrable Riccati equation. The classification is carried out of solutions by the acceleration vector in the Lagrangian coordinates. Some example is given of an invariant solution for which the selected volume “collapses” to an interval.     

Tracking within a time interval on the basis of data supplied by finite observers

We solve the tracking control problem, in which one should bring a trajectory of a system of linear ordinary differential equations into a neighborhood of a trajectory of another system within a given time interval. After getting into this neighborhood, one should keep the trajectory of the first subsystem in it for a time interval of given duration. For the control synthesis, we use incomplete and imprecise information on the online deviation of one trajectory from the other, which is obtained in real time from linear equations of observation. We consider distinct structures of observers, which substantially affect the solution of control problems for such systems. The equations of dynamics and admissible measurements contain uncertainty for which one knows only some hard pointwise constraints. To solve the main problem, we use an approach that can be reduced to the construction of auxiliary information sets and weakly invariant sets with a subsequent “aiming” of one set at a tube. We suggest an efficient method for an approximate solution on the basis of ellipsoidal calculus techniques. The results of the algorithm operation are illustrated by an example of the solution of a tracking control problem for two fourth-order subsystems.     

Legendre polynomial solutions of high-order linear Fredholm integro-differential equations

In this study, a Legendre collocation matrix method is presented to solve high-order Linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials. The proposed method converts the equation and conditions to matrix equations, by means of collocation points on the interval [−1, 1], which corresponding to systems of linear algebraic equations with Legendre coefficients. Thus, by solving the matrix equation, Legendre coefficients and polynomial approach are obtained. Also examples that illustrate the pertinent features of the method are presented and by using the error analysis, the results are discussed.