Results 91 to 100 of about 6,693 (226)

The Benjamin–Ono Equation in the Zero‐Dispersion Limit for Rational Initial Data: Generation of Dispersive Shock Waves

Communications on Pure and Applied Mathematics, EarlyView.
ABSTRACT The leading‐order asymptotic behavior of the solution of the Cauchy initial‐value problem for the Benjamin–Ono equation in L2(R)$L^2(\mathbb {R})$ is obtained explicitly for generic rational initial data u0$u_0$. An explicit asymptotic wave profile uZD(t,x;ε)$u^\mathrm{ZD}(t,x;\epsilon)$ is given, in terms of the branches of the multivalued ...
Elliot Blackstone, Louise Gassot, Patrick Gérard, Peter D. Miller   +3 more
wiley   +1 more source

Stochastic Gradient Descent in High Dimensions for Multi‐Spiked Tensor PCA

Communications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We study the high‐dimensional dynamics of online stochastic gradient descent (SGD) for the multi‐spiked tensor model. This multi‐index model arises from the tensor principal component analysis (PCA) problem with multiple spikes, where the goal is to estimate the unknown signal vectors within the N$N$‐dimensional unit sphere through maximum ...
Gérard Ben Arous, Cédric Gerbelot, Vanessa Piccolo   +2 more
wiley   +1 more source

Matrix interpretation of multiple orthogonality

, 2010
In this work we give an interpretation of a (s(d + 1) + 1)-term recurrence relation in terms of type II multiple orthogonal polynomials.We rewrite this recurrence relation in matrix form and we obtain a three-term recurrence relation for vector ...
Branquinho, Amílcar, Foulquié Moreno, Ana Pilar, Cotrím, Luís   +2 more
core   +1 more source

Semi‐analytical solution for the stability of deep vertical shaft considering time‐dependent rock‐structure interaction

Deep Underground Science and Engineering, EarlyView.
A novel cavity contraction solution and multilayer shaft wall model were developed to analyze deep shaft stability, considering rock viscosity, support structures, and water pressure, with successful validation through a Hulusu Coal Mine case study.
Bin Chen, Pinqiang Mo, Zhao Lu, Lianfei Kuang, Qiang Zhang, Abolfazl Eslami   +5 more
wiley   +1 more source

Subspace Acceleration for Efficient Nonlinear Water Wave Simulation

International Journal for Numerical Methods in Fluids, EarlyView.
We introduce an exponentially weighted subspace acceleration technique to reduce GMRES iterations for solving the Poisson equation with time‐dependent coefficients in nonlinear, dispersive free‐surface flows governed by the incompressible Navier‐Stokes equations. The method significantly reduces memory requirements and computational complexity compared
Rasmus Kleist Hørlyck Sørensen, Margherita Guido, Allan Peter Engsig‐Karup, Daniel Kressner   +3 more
wiley   +1 more source

Polymer informatics: Integrating data‐driven strategies, advanced machine learning, and automated synthesis for next‐generation polymer design

InfoScience, EarlyView.
Designing new polymers for applications such as sustainable plastics, biomaterials, and 3D printing has traditionally been slow and expensive, relying heavily on trial‐and‐error experiments. This review shows how polymer informatics—the integration of large polymer databases, machine‐learning models, and automated robotic synthesis—enables fast ...
Md. Saiful Islam, Tamanna Hoque, Junied Islam Shuvo, Sheta Roy Tori, Sadit Bihongo Malitha, Md. Zahangir Alam, A. M. Sarwaruddin Chowdhury   +6 more
wiley   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

Journal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang, David Hume, Samuel J. Kelly, Ryan Lam   +3 more
wiley   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon   +5 more
wiley   +1 more source