Results 31 to 40 of about 2,716 (179)

A Novel Optimized Local Linearization Hybrid Block Method for Chaotic Systems: Applications to Stretch‐Twist‐Fold Flow and Bond Orbital Chaotic Attractors

open access: yesMathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT The numerical approximation of nonlinear chaotic differential systems, such as the modified stretch‐twist‐fold (STF) flow and multi‐bond chaotic attractors, presents a significant challenge due to their sensitive dependence on initial conditions and complex dynamics where analytical solutions are unattainable.
Shina Daniel Oloniiju, Anastacia Dlamini
wiley   +1 more source

Volume Quantization with Flexible Singularities for Hexahedral Meshing

open access: yesComputer Graphics Forum, EarlyView.
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley   +1 more source

Homotopy analysis method for solving KdV equations [PDF]

open access: yesSurveys in Mathematics and its Applications, 2010
A scheme is developed for the numerical study of the Korteweg-de Vries (KdV) and the Korteweg-de Vries Burgers (KdVB) equations with initial conditions by a homotopy approach.
Hossein Jafari, M. A. Firoozjaee
doaj  

Solving Famous Nonlinear Coupled Equations with Parameters Derivative by Homotopy Analysis Method

open access: yesInternational Journal of Differential Equations, 2011
The homotopy analysis method (HAM) is employed to obtain symbolic approximate solutions for nonlinear coupled equations with parameters derivative. These nonlinear coupled equations with parameters derivative contain many important mathematical physics ...
Sohrab Effati   +2 more
doaj   +1 more source

Homotopy Analysis-Based Hybrid Genetic Algorithm and Secant Method to Solve IVP and Higher-Order BVP

open access: yesIEEE Access, 2021
The analytical solution of the Initial Value Problem (IVP) and the Boundary Value Problem (BVP) is an essential issue in numerous engineering applications. However, it cannot usually be realized by simple methods.
Hala A. Omar
doaj   +1 more source

Establishing Shape Correspondences: A Survey

open access: yesComputer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Embedding Optimization of Layouts via Distortion Minimization

open access: yesComputer Graphics Forum, EarlyView.
Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley   +1 more source

An Analytical Study for (2 + 1)-Dimensional Schrödinger Equation

open access: yesThe Scientific World Journal, 2014
In this paper, the homotopy analysis method has been applied to solve (2 + 1)-dimensional Schrödinger equations. The validity of this method has successfully been accomplished by applying it to find the solution of some of its variety forms.
Behzad Ghanbari
doaj   +1 more source

A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded

open access: yesComputer Graphics Forum, EarlyView.
Abstract Grid maps – spatially arranged small multiples – are a powerful tool to show complex geospatial data. Meulemans et al. (2020) introduced a pipeline for computing high‐quality grid maps that are shaped roughly according to their containing geographic outlines.
W. Meulemans
wiley   +1 more source

On computing local monodromy and the numerical local irreducible decomposition

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards   +1 more
wiley   +1 more source

Home - About - Disclaimer - Privacy