- linearization BASED UPON DIFFERENTIAL APPROXIMATION AND GALERKIN ' S METHOD

نویسنده

  • J. M. RICHARDSON
چکیده

We present a new linearization technique based upon differential approximation which is considerably simpler and more flexible than those used in our previous work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation

In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...

متن کامل

An Extension of the Legendre-Galerkin Method for Solving Sixth-Order Differential Equations with Variable Polynomial Coefficients

We extend the application of Legendre-Galerkin algorithms for sixth-order elliptic problems with constant coefficients to sixth-order elliptic equations with variable polynomial coefficients. The complexities of the algorithm are O(N) operations for a one-dimensional domain with N − 5 unknowns. An efficient and accurate direct solution for algorithms based on the LegendreGalerkin approximations...

متن کامل

Benchmark Results for Testing Adaptive Finite Element Eigenvalue Procedures

A discontinuous Galerkin method, with hp-adaptivity based on the approximate solution of appropriate dual problems, is employed for highly-accurate eigenvalue computations on a collection of benchmark examples. After demonstrating the effectivity of our computed error estimates on a few well-studied examples, we present results for several examples in which the coefficients of the partial-diffe...

متن کامل

Efficient computable error bounds for discontinuous Galerkin approximations of elliptic problems

We present guaranteed and computable both sided error bounds for the discontinuous Galerkin (DG) approximations of elliptic problems. These estimates are derived in the full DG-norm on purely functional grounds by the analysis of the respective differential problem, and thus, are applicable to any qualified DG approximation. Based on the triangle inequality, the underlying approach has the foll...

متن کامل

Local Jacobian based Galerkin Order Reduction for the Approximation of Large-Scale Nonlinear Dynamical Systems

In automotive applications large-scale nonlinear dynamical models are utilized for hardware-in-the-loop simulations and model-based controller design. A projection-based order reduction of these models, on the one hand, yields substantial advantages in computational speed and on the other hand, simplifies the controller design procedure. In this work a mathematical-empirical approach is chosen ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016