Results 171 to 180 of about 2,297,129 (216)

Immersed Boundary Projection Method for Boundaries With Slip Velocities

International Journal for Numerical Methods in Fluids, EarlyView.
A formulation of the immersed boundary method for incompressible flow over arbitrarily‐shaped bodies with surface slip described by the Navier boundary condition is presented. The wall slip velocity and the boundary force are determined implicitly through a projection to satisfy both the boundary condition and the divergence‐free condition of the ...
Takehiro Fujii, Takeshi Omori
wiley   +1 more source

Verification of an Incompressible Viscoelastic Flow Solver Using the Method of Manufactured Solutions for Oldroyd‐B and Giesekus Constitutive Models

International Journal for Numerical Methods in Fluids, EarlyView.
This study utilizes the Method of Manufactured Solutions (MMS) to validate high‐order compact finite‐difference schemes for 2D incompressible viscoelastic flows. By applying Oldroyd‐B and Giesekus models to a lid‐driven cavity benchmark, the researchers rigorously assessed numerical accuracy across varying Reynolds and Weissenberg numbers.
Juniormar Organista, Leandro F. Souza, Célio Fernandes, Welton L. Costa, Aquisson T. G. da Silva, Antonio Castelo   +5 more
wiley   +1 more source

High‐Order Projection‐Based Upwind Method for Simulation of Transitional Turbulent Flows

International Journal for Numerical Methods in Fluids, EarlyView.
In this study, we evaluated the implicit large‐eddy simulation capabilities of the mass‐conserving mixed stress method for transitional turbulent flows and proposed an efficient solution method for large‐scale applications. The results presented in this work show promising outcomes for incompressible aerodynamic flow problems, which can be further ...
Philip L. Lederer, Xaver Mooslechner, Joachim Schöberl   +2 more
wiley   +1 more source

Hybrid Temporal Autoencoder and Similarity Matching for Low Aggregation Level Long Time Series Forecasting

Journal of Forecasting, EarlyView.
ABSTRACT Deep learning‐based long time series forecasting (LTSF) has achieved high accuracy by effectively capturing the underlying trends, seasonality, and temporal dependencies within time series data. However, at the individual entity level, termed the low aggregation level (LAL), intermittency, irregularity, and data sparsity undermine the ...
Hanbyeol Park, Sunghyun Sim, Kikun Park, Yongjae Lee, Eunhee Park, Hyerim Bae   +5 more
wiley   +1 more source

A Proof of the Polynomiality of the Iri-Imai Method

Journal of Complexity, 1993
The polynomiality of the time complexity of the multiplicative penalty function method proposed by In and Imai is proved based on detailed analysis of properties possessed by the Newton vector the method generates. The proof technique is readily extended
Masao Iri
exaly   +2 more sources

About Polynomiality of the Poisson Semicentre for Parabolic Subalgebras

Progress in Mathematics, 2019
International audienceHere we explain some results about polynomiality of the Poisson semicentre for parabolic subalgebras in a complex simple Lie algebra in the particular case of maximal parabolic subalgebras in a simple Lie algebra of type ...
Florence Fauquant-Millet, Fauquant-Millet, Florence   +1 more
exaly   +2 more sources

Matrix recursive polynomial interpolation algorithm: An algorithm for computing the interpolation polynomials

Journal of Computational and Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Messaoudi, Rachid Sadaka, Hassane Sadok   +2 more
openaire   +3 more sources

A polynomial decomposition algorithm

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) = g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.
David R. Barton, Richard E. Zippel
openaire   +1 more source

Polynomiality of Hurwitz numbers, Bouchard–Mariño conjecture, and a new proof of the ELSV formula

Advances in Mathematics, 2015
In this paper we give a new proof of the ELSV formula. First, we refine an argument of Okounkov and Pandharipande in order to prove (quasi-)polynomiality of Hurwitz numbers without using the ELSV formula (the only way to do that before used the ELSV ...
Petr Dunin-Barkowski
exaly   +2 more sources

Extended polynomial algorithms

Proceedings of the annual conference on - ACM'73, 1973
It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.
Anthony C. Hearn, Rüdiger G. K. Loos
openaire   +2 more sources