Construction of a system of linear vector integral equations in diffraction problems

The numerical solution of integral equations or a system of integral equations (for a system of conductors) consists in their discretization and reduction to a system of linear algebraic equations for the desired function. For discretization, it is possible to use projection methods, for example, the Galerkin method or the collocation method. A system of linear algebraic equations for the class of problems under consideration is characterized by a complete (filled) complex matrix. For conductor antenna structures that are quite arbitrary in geometry and size, systems of linear algebraic equations turn out to be of a high order, and special computational algorithms are required to solve them. The purpose of the work is to study adequate mathematical models for wire antennas with a subsequent description of uniform numerical algorithms based on methods of sampling and approximation of antenna current. With this method, the error in solving integral equations is determined by the error in calculating the elements of the matrix of a system of linear algebraic equations for a given piecewise polynomial approximation of the solution at step h. If the quadrature formula for numerical integration is chosen, then there are two ways to reduce the solution error. An increase in the number of collocation points leads to a rapid increase in the volume of calculations and, consequently, to a rapid increase in the amount of occupied computer memory. Therefore, the question arises of choosing the most profitable method of piecewise polynomial interpolation and discretization step h from the point of view of using computer resources, ensuring an acceptable number of solutions.

Subject. This article focuses on the problems of solving systems of homogeneous linear algebraic equations in the pricing problems of an alternative financial model. Objectives. The article aims to develop a non-trivial approach to solving the problem of pricing from the scratch in the construction of a national alternative financial model, which boils down to solving large homogeneous systems of linear algebraic equations, complicated by the fuzzy setting of initial parameters (initial data) within the framework of creating a State model of a socially oriented economy, guaranteed to ensure economic, military and other types of integrated security of the Russian Federation. Methods. For the study, we used tensorial notations involving the use of elements of linear algebra, including operations with matrices and vectors, the apparatus of the fuzzy set theory (interval arithmetic), as well as methods and principles of scientific research and complex logical analysis and modeling of pricing and technological processes. Results. The article shows that an effective non-zero (different from zero, i.e. classical, trivial) solution of systems of homogeneous algebraic equations in pricing problems of an alternative financial model from the scratch is possible if the initial parameters are specified by fuzzy sets, which significantly simplifies the procedure of the computational process and the volume of arithmetic operations. Conclusions. The results obtained can be used in structures involved in the creation and testing of financial and economic models both at the federal and the Russian Federation constituent entity levels, as well as in governmental and non-governmental organizations dealing with the issues of pricing, planning and logistics support for business entities not only in the Russian Federation, but also in other countries experiencing problems in the field of financing.

A new technique for solving the large system of linear algebraic equations associated with implicit differencing of multidimensio nal partial differential equations is presented. The coefficient matrix of the equations is factored, and then approximations to certain terms in the matrix are obtained from series expansions. The resulting system of equations is solved easily. The method is developed and demonstrated using a simple representative two-dimensional equation. Very good results are obtained when one direction is dominant. MPLICIT finite-difference schemes for the solution of multidimensional partial differential equations are usually stable and therefore applicable to a large class of problems. However, they are difficult to implement and may require an excessive amount of computer storage and time. The long computing time arises from the need to solve the large system of linear algebraic equations that result from the differencing. The computing time can be reduced significantly by approximating the coefficient matrix of the linear equations with a matrix that produces a system of equations that are relatively easy to solve. Among such methods are the alternating direction method (ADI)l used by Beam and Warming2 and Stone's strongly implicit method,3 which has been tested by Linetal.4 In this paper, a new technique for solving the large system of linear algebraic equations associated with implict differencing of multidimensional partial differential equations is presented. This method, called the pseudo-elimination method (PE), is shown to be faster than Stone's method for certain problems. The method is directly applicable to linear and linearized nonlinear systems of parabolic or elliptic partial differential equations. In order to discuss the method, a simple linear partial differential equation will be used; however, it should be kept in mind that the PE method is applicable to much more complicated problems. The question of whether the method will work when applied to difficult problems is not addressed. The scope of this paper is limited to presenting the method and illustrating, via a simple problem, that the method has some merit and deserves further study.

In this research paper a new modification of Gauss-Seidel method has been presented for solving the system of linear algebraic equations. The systems of linear algebraic equations have an important role in the field of science and engineering. This modification has been developed by using the procedure of Gauss-Seidel method and the concept of substitution techniques. Developed modification of Gauss-Seidel method is a fast convergent as compared to Gauss Jacobi’s method, Gauss-Seidel method and successive over-relaxation (SOR) method. It works on the diagonally dominant as well as positive definite symmetric systems of linear algebraic equations. Its solution has been compared with the Gauss Jacobi’s method, Gauss-Seidel method and Successive over-Relaxation method by taking different systems of linear algebraic equations and found that, it was reducing to the number of iterations and errors in each problem.

Iterative refinement of solution with biparameter for solving ill-conditioned systems of linear algebraic equations

There are no strict rules for the numerical treatment of partial differential equations. We concentrate here on linear partial differential equations. As an example of elliptic partial differential equations the two-dimensional Poisson equation with Dirichlet boundary conditions is investigated. The application of the finite difference approximation transforms this equation into a set of algebraic equations which can be solved iteratively. The time dependent heat equation is an example of parabolic partial differential equations. The one-dimensional Dirichlet boundary value problem is transformed using the implicit and explicit Euler method into an inhomogeneous system of linear algebraic equations. Stability problems of the explicit Euler method are discussed and demonstrated numerically. The wave equation is a model for hyperbolic partial differential equations. It can be transformed into a system of algebraic equations using, for instance, the explicit Euler method. Again, stability problems connected with this method are discussed and demonstrated numerically. Finally, the quantum mechanical tunneling effect is studied numerically by solving the time dependent Schrodinger equation by means of a Crank-Nicholson scheme which transforms the Schrodinger equation into a system of linear algebraic equations with tridiagonal matrix.

The article deals with high-performance information technology (HPC) for the problems of stress-strain analysis at all stages of the life cycle of buildings and structures: construction, operation and reconstruction. The results of numerical simulation of high buildings using software as a processor component based on a new hybrid algorithm for solving systems of linear algebraic equations [1] with a symmetric positive-definite matrix that combines computation on multi-core processors and graphs. It has been found that to accelerate the calculations, hybrid systems that combine multi-core CPUs with accelerator coprocessors, including GPUs, are promising [5]. To test the effectiveness of the proposed parallel algorithm for solving systems of linear algebraic equations [1], numerical experiments were carried out at the most dangerous loads of a 27-story building. Results of numerical researches with use for preprocessor (input of initial data) and postprocessor (output of results of calculations) of processing of the LIRA-SAPR software complex are presented [2, 4, 6]. The results of numerical studies of the behavior of structures of high buildings have shown a multiple reduction in the time of solving systems of linear algebraic equations with symmetric matrices on multiprocessor (multi-core) computers with graphical accelerators using the proposed hybrid algorithms [1]. High-performance technologies based on parallel calculations give more effect than more complex processes: modeling of life cycle of high buildings, bridges, especially complex structures of NPPs, etc. for static and dynamic loads, including emergencies in normal and difficult geological conditions, which make up 70% of Ukraine's territories.

The possibilities of the algorithm for applying the boundary element method to solving boundary value problems are discussed on the example of the two-dimensional Poisson differential equation. The algorithm does not change significantly when the type of boundary conditions changes: the Dirichlet problem, the Neumann problem, or a mixed boundary value problem. The idea of the algorithm is taken from the work of John T. Katsikadelis [1]. The algorithm is described in detail in the next sequence of actions. 1) The boundary- value problem for a two-dimensional finite domain is formulated. The desired function in the domain, its values, and its normal derivative on the boundary contour are connected by means of the second Green formula. 2) We pass from the boundary value problem for the Poisson equation to the boundary value problem for the Laplace equation. This simplifies the process of constructing an integral equation. We obtain the integral equation on the boundary contour using the boundary conditions. 3) In the integral equation, we divide the boundary contour into a finite number of boundary elements. The desired function and its normal derivative are considered constant values on each boundary element. We compose a system of linear algebraic equations considering these values. 4) We modify the system of linear algebraic equations taking into account the boundary conditions. After that, we solve it using the Gauss method. The computer program has been developed according to the developed algorithm. We used it in the learning process. The software implementation of the algorithm takes into account the capabilities of modern computer technology and modern needs of the educational process. The work of the program is shown in the test case. Further modification of the described algorithm is possible

A scalar three-dimensional boundary value problem of wave diffraction for the Helmholtz equation with transmission conditions that assume the presence of an infinitely thin material at the media interface is considered. Uniqueness and existence theorems for solutions are proved. The original problem is reduced to a system of integral equations over the media interface. Calculation formulas for the system of linear algebraic equations obtained after applying the collocation method and numerical results for solving the problem when the domain is a ball with certain transmission conditions are given.

Conventional conditioning criteria are shown to be invalid for estimating the accuracy of a numerical calculation for systems of linear algebraic equations. A new conditioning criterion is proposed, quantitatively describing the actual loss of decimal digits in calculations. The adequacy of this criterion is confirmed by examples of numerical calculations. Conditioning criteria have been obtained for some types of linear systems arising in important applied problems, in particular, in the difference solution of differential or integral equations.

In this paper, orthonormal Bernoulli collocation method has been developed to obtain the approximate solution of linear singular stochastic Itô‐Volterra integral equations. By applying this method, linear stochastic integral equation converts to linear system of algebraic equations. This system is achieved by approximating functions that appear in the stochastic integral equations by using orthonormal Bernoulli polynomials (OBPs) and then substituting these approximations into consideration equation. This linear system of algebraic equations can be solved via an appropriate numerical method and approximate solution of integral equation is obtained. A main advantage of this technique is that the condition number of the coefficient matrix of the system is small, which verify that THE proposed method is stable. Also, convergence and error analysis of the present method are discussed. Finally, two examples are given to show the pertinent properties, applicability, and accuracy of the present method.

The main aim of this paper is to numerically solve the first kind linear Fredholm and Volterra integral equations by using Modified Bernstein–Kantorovich operators. The unknown function in the first kind integral equation is approximated by using the Modified Bernstein–Kantorovich operators. Hence, by using discretization, the obtained linear equations are transformed into systems of algebraic linear equations. Due to the sensitivity of the solutions on the input data, significant difficulties may be encountered, leading to instabilities in the results during actualization. Consequently, to improve on the stability of the solutions which imply the accuracy of the desired results, regularization features are built into the proposed numerical approach. More stable approximations to the solutions of the Fredholm and Volterra integral equations are obtained especially when high order approximations are used by the Modified Bernstein–Kantorovich operators. Test problems are constructed to show the computational efficiency, applicability and the accuracy of the method. Furthermore, the method is also applied to second kind Volterra integral equations.

The article proposes a generalized polynomial projection method for solving linear integral equations with a fractional Riemann - Liouville integral in the main part. Fractional-integral equations have numerous applications in various applied problems, in particular, in problems of plasma diagnostics, optical and X-ray diffraction, in ultrasonic measurements in moving media, in metallurgy, biology, microscopy, seismology, in astrophysics and other fields of science.The equation we are considering is an equation of the first kind and therefore, generally speaking, refers to incorrectly set by Hadamard equations. The latter circumstance is connected with the fact that in known function spaces the fractional integral Riemann-Liouville operator is completely continuous. All this imposes its own characteristics on the construction and study of approximate methods for solving integral equations with a fractional integral operator in the main part. It should be noted that the operator of the projection method is not necessarily projective, which allows the construction of computational schemes using the methods of summation of Fourier series and interpolation polynomials. A theoretical and functional substantiation of the proposed projection method was carried out, based on the correct formulation of the equation in a pair of specially selected different Holder spaces. In particular, it proved the unique solvability of the system of linear algebraic equations of the method and the convergence of the constructed approximations to the exact solution in the norm of the space of Holder functions and, as a consequence, in the uniform metric. This also implies the substantiation of specific well-known projection methods such as the Galerkin methods, colocations, and subdomains.

The first equations of the 1940 pantograph were considered in the works of Mahler. He used functional differential equations with compression arguments in number theory. He used functional differential equations with compression arguments in number theory. In 1971, J. Ockendon used functional differential equations with transformed arguments of the form to describe the motion of an electric locomotive pantograph. Recently, pantograph type equations have been widely used. For example, a configurable (pantograph) phone device holder, a retractable (pantograph) microphone device, etc. In this article, on the segment discusses a two-point boundary value problem for systems of integro-differential equations of the pantograph type. To solve this problem, the parameterization method proposed by Professor D. Dzhumabaev is used. To do this, we divide the segment in question into parts. Let's denote the value of the desired function at the starting point of each segment through the parameters and replace it in the intervals . Then the problem under consideration is formally divided into two parts, i.e., a system of linear algebraic equations with respect to the introduced parameters and to the Cauchy problem for a system of integro-differential equations of the pantograph type. Thus, the problem is reduced to a closed system for determining the solution of a special Cauchy problem for systems of integro–differential equations of the pantograph type and a system of linear equations. Based on this, an algorithm for determining the solution of the initial problem is proposed.

The possibility of application of the interval analysis for data processing in the field of spectral analysis is considered. It is assumed that the data have interval uncertainty; therefore the problem of finding unknown concentrations is posed as a linear interval tolerance problem. The incompatibility of the interval system of linear algebraic equations is shown for the initial data using the apparatus of the recognizing functional. The relevance of the topic is due to the need for regularization of inconsistent interval systems of linear equations. The idea of S. P. Shary of a combined method for correcting a linear tolerance problem has been implemented. A new method for managing the solution by changing the linear algebraic equations interval system matrix elements radii has been developed. The research results can be used for example, to calculate the substance’s concentrations by measurement of the characteristic X-ray radiation.