Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Euler method”

The Prae-Euler Summation Method.

Karl Nickel · Defense Technical Information Center (DTIC) · 1971

The method prescribed accelerates the speed of convergence in a large class of alternating series. A priori bounds are given. A numerical algorithm is discussed. (Author)

Cited by 1

About the Newton-Euler method

Mauricio Anigstein · Journal of Robotic Systems · 1999

The Newton–Euler method for the calculation of the manipulator dynamics is analyzed, using a general form of the Euler equation for the rigid body. The proposed approach allows the direct resolution of manipulator problems which previously seemed to need specific methods to be tackled. The coordinate systems role and the validity of the obtained equations for revolute and prismatic joints are clarified. ©1999 John Wiley & Sons, Inc.

Cited by 4

Degenerate Euler- Seidel Method for degenerate Bernoulli, Euler, and Genocchi polynomials

Taekyun Kim, Dae San Kim, Hyunseok Lee et al. · arXiv (Cornell University) · 2025

This paper introduces a degenerate version of the Euler-Seidel method by incorporating a parameter lambda into the classical recurrence relation. We define a degenerate Euler-Seidel matrix associated with an initial sequence and establish corresponding lambda-generalized binomial identities and generating function relations. By applying this method to the degenerate Bernoulli, Euler, and Genocchi polynomials, we derive several new combinatorial identities. This work extends the classical Euler-Seidel method to the domain of degenerate special polynomials and numbers, providing a new framework for studying their properties.

Cited by 0Open access

Degenerate Euler- Seidel Method for degenerate Bernoulli, Euler, and Genocchi polynomials

Taekyun Kim, Dae San Kim, Hyunseok Lee et al. · ArXiv.org · 2025

This paper introduces a degenerate version of the Euler-Seidel method by incorporating a parameter lambda into the classical recurrence relation. We define a degenerate Euler-Seidel matrix associated with an initial sequence and establish corresponding lambda-generalized binomial identities and generating function relations. By applying this method to the degenerate Bernoulli, Euler, and Genocchi polynomials, we derive several new combinatorial identities. This work extends the classical Euler-Seidel method to the domain of degenerate special polynomials and numbers, providing a new framework for studying their properties.

Cited by 0Open access

Improvements to the aircraft Euler method

A. Jameson, Timothy J. Baker · 25th AIAA Aerospace Sciences Meeting · 1987

An unstructured mesh of tetrahedra offers an attractive approach to mesh generation for complex three dimensional shapes. The combination of a method for constructing tetrahedral meshes and a finite element technique for solving the Euler equations has resulted in a powerful new approach to the problem of calculating flows over complex geometries. Recent progress and improvements to the authors' aircraft Euler method are described and results presented to demonstrate its capability.

Cited by 162

Lyapunov stability of the Euler method

Cédric Josz · arXiv (Cornell University) · 2025

We extend the Lyapunov stability criterion to Euler discretizations of differential inclusions. It relies on a pair of Lyapunov functions, one in continuous time and one in discrete time. In the context of optimization, this yields sufficient conditions for the stability of nonisolated local minima when using the Bouligand subgradient method.

Cited by 0Open access

Stopped Brownian-increment tamed Euler method

Kisker, Kai · Universitätsbibliographie, Universität Duisburg-Essen · 2025

In this thesis we propose a new explicit Euler-type approximation method for stochastic differential equations (SDEs). In this method, Brownian increments in the recursion of the Euler method are replaced by suitable bounded functions of the Brownian increments. We prove strong convergence rate one-half for a large class of SDEs with polynomial coefficient functions whose local monotonicity constant grows at most like the logarithm of a Lyapunov-type function.

Cited by 0Open access

TABULAR FORM OF EULER MODIFIED METHOD

M. Srinivas, Md. Shafeeur Rahman · International Journal of Engineering Applied Sciences and Technology · 2021

t— There exist many single step methods to find the solution to a first order ordinary differential equation. Often time consuming and complicated. The proposed method is the alternate way of Euler modified method in the tabular form. Easy to understand and calculate

Cited by 0Open access