• Title/Summary/Keyword: Approximate Equation

Search Result 487, Processing Time 0.022 seconds

Study for State Analysis of Linear Systems by using Hartley Functions (Harltley 함수를 이용한 선형시스템의 상태해석에 관한 연구)

  • Kim, Beom-Soo;Min, Chi-Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.9
    • /
    • pp.806-811
    • /
    • 2012
  • In this paper Hartley functions are used to approximate the solutions of continuous time linear dynamical system. The Hartley function and its integral operational matrix are first presented, an efficient algorithm to solve the Stein equation is proposed. The algorithm is based on the compound matrix and the inverse of sum of matrices. Using the structure of the Hartley's integral operational matrix, the full order Stein equation should be solved in terms of the solutions of pure algebraic matrix equations, which reduces the computation time remarkably. Finally a numerical example is illustrated to demonstrate the validity of the proposed algorithm.

ON FIXED POINT OF UNIFORMLY PSEUDO-CONTRACTIVE OPERATOR AND SOLUTION OF EQUATION WITH UNIFORMLY ACCRETIVE OPERATOR

  • Xu, Yuguang;Liu, Zeqing;Kang, Shin-Min
    • East Asian mathematical journal
    • /
    • v.24 no.3
    • /
    • pp.305-315
    • /
    • 2008
  • The purpose of this paper is to study the existence and uniqueness of the fixed point of uniformly pseudo-contractive operator and the solution of equation with uniformly accretive operator, and to approximate the fixed point and the solution by the Mann iterative sequence in an arbitrary Banach space or an uniformly smooth Banach space respectively. The results presented in this paper show that if X is a real Banach space and A : X $\rightarrow$ X is an uniformly accretive operator and (I-A)X is bounded then A is a mapping onto X when A is continuous or $X^*$ is uniformly convex and A is demicontinuous. Consequently, the corresponding results which depend on the assumptions that the fixed point of operator and solution of the equation are in existence are improved.

  • PDF

Moment Lyapunov exponents of the Parametrical Hill's equation under the excitation of two correlated wideband noises

  • Janevski, Goran;Kozic, Predrag;Pavlovic, Ivan
    • Structural Engineering and Mechanics
    • /
    • v.52 no.3
    • /
    • pp.525-540
    • /
    • 2014
  • The Lyapunov exponent and moment Lyapunov exponents of Hill's equation with frequency and damping coefficient fluctuated by correlated wideband random processes are studied in this paper. The method of stochastic averaging, both the first-order and the second-order, is applied. The averaged $It\hat{o}$ differential equation governing the pth norm is established and the pth moment Lyapunov exponents and Lyapunov exponent are then obtained. This method is applied to the study of the almost-sure and the moment stability of the stationary solution of the thin simply supported beam subjected to time-varying axial compressions and damping which are small intensity correlated stochastic excitations. The validity of the approximate results is checked by the numerical Monte Carlo simulation method for this stochastic system.

Modeling radon diffusion equation in soil pore matrix by using uncertainty based orthogonal polynomials in Galerkin's method

  • Rao, T.D.;Chakraverty, S.
    • Coupled systems mechanics
    • /
    • v.6 no.4
    • /
    • pp.487-499
    • /
    • 2017
  • This paper investigates the approximate solution bounds of radon diffusion equation in soil pore matrix coupled with uncertainty. These problems have been modeled by few researchers by considering the parameters as crisp, which may not give the correct essence of the uncertainty. Here, the interval uncertainties are handled by parametric form and solution of the relevant uncertain diffusion equation is found by using Galerkin's Method. The shape functions are taken as the linear combination of orthogonal polynomials which are generated based on the parametric form of the interval uncertainty. Uncertain bounds are computed and results are compared in special cases viz. with the crisp solution.

Time-Dependent Neutron Transport Equation with Delayed Neutrons

  • Yoo, Kun-Joong;Pac, Pong-Youl
    • Nuclear Engineering and Technology
    • /
    • v.4 no.2
    • /
    • pp.102-108
    • /
    • 1972
  • Time-dependent neutron transport equation with delayed neutrons is analytic-ally solved in the case of isotropic scattering with constant cross sections. The equations in the two divided time regions are obtained from the original equation by the asymptotic method. It is shown that the approximate solutions in each time region are uniformly valid in time to the order of the inverse magnitude of the velocity.

  • PDF

NUMERICAL SOLUTION OF THE NONLINEAR KORTEWEG-DE VRIES EQUATION BY USING CHEBYSHEV WAVELET COLLOCATION METHOD

  • BAKIR, Yasemin
    • Honam Mathematical Journal
    • /
    • v.43 no.3
    • /
    • pp.373-383
    • /
    • 2021
  • In this study, a numerical method deals with the Chebyshev wavelet collocation and Adomian decomposition methods are proposed for solving Korteweg-de Vries equation. Integration of the Chebyshev wavelets operational matrices is derived. This problem is reduced to a system of non-linear algebraic equations by using their operational matrix. Thus, it becomes easier to solve KdV problem. The error estimation for the Chebyshev wavelet collocation method and ADM is investigated. The proposed method's validity and accuracy are demonstrated by numerical results. When the exact and approximate solutions are compared, for non-linear or linear partial differential equations, the Chebyshev wavelet collocation method is shown to be acceptable, efficient and accurate.

APPROXIMATION OF FIXED POINTS AND THE SOLUTION OF A NONLINEAR INTEGRAL EQUATION

  • Ali, Faeem;Ali, Javid;Rodriguez-Lopez, Rosana
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.5
    • /
    • pp.869-885
    • /
    • 2021
  • In this article, we define Picard's three-step iteration process for the approximation of fixed points of Zamfirescu operators in an arbitrary Banach space. We prove a convergence result for Zamfirescu operator using the proposed iteration process. Further, we prove that Picard's three-step iteration process is almost T-stable and converges faster than all the known and leading iteration processes. To support our results, we furnish an illustrative numerical example. Finally, we apply the proposed iteration process to approximate the solution of a mixed Volterra-Fredholm functional nonlinear integral equation.

A FAST KACZMARZ-KOVARIK ALGORITHM FOR CONSISTENT LEAST-SQUARES PROBLEMS

  • Popa, Constantin
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.9-26
    • /
    • 2001
  • In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

AN ITERATIVE ALGORITHM FOR THE LEAST SQUARES SOLUTIONS OF MATRIX EQUATIONS OVER SYMMETRIC ARROWHEAD MATRICES

  • Ali Beik, Fatemeh Panjeh;Salkuyeh, Davod Khojasteh
    • Journal of the Korean Mathematical Society
    • /
    • v.52 no.2
    • /
    • pp.349-372
    • /
    • 2015
  • This paper concerns with exploiting an oblique projection technique to solve a general class of large and sparse least squares problem over symmetric arrowhead matrices. As a matter of fact, we develop the conjugate gradient least squares (CGLS) algorithm to obtain the minimum norm symmetric arrowhead least squares solution of the general coupled matrix equations. Furthermore, an approach is offered for computing the optimal approximate symmetric arrowhead solution of the mentioned least squares problem corresponding to a given arbitrary matrix group. In addition, the minimization property of the proposed algorithm is established by utilizing the feature of approximate solutions derived by the projection method. Finally, some numerical experiments are examined which reveal the applicability and feasibility of the handled algorithm.

Shape factors of cylindrical permeameters

  • Silvestri, Vincenzo;Samra, Ghassan Abou;Bravo-Jonard, Christian
    • Geomechanics and Engineering
    • /
    • v.3 no.1
    • /
    • pp.17-28
    • /
    • 2011
  • This paper presents an analytical solution for steady state flow into a close-ended cylindrical permeameter. The soil medium is considered to be uniform, isotropic, and of infinite thickness. Laplace equation is solved by considering rotational symmetry and by using curvilinear coordinates obtained from conformal mapping. The deduced shape factors, which are compared to approximate relationships obtained from both numerical and physical modelling, and idealizations involving ellipsoidal cavities, are proposed for use in field measurements. It is shown that some of the shape factors obtained are significantly different from published values and show a much higher dependence of the rate of flow on the aspect ratio, than deduced from approximate solutions.