Results 101 to 110 of about 262,580 (281)

Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic

open access: yesCommunications on Pure and Applied Mathematics, EarlyView.
ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley   +1 more source

Considering spatiotemporal evolutionary information in dynamic multi‐objective optimisation

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Preserving population diversity and providing knowledge, which are two core tasks in the dynamic multi‐objective optimisation (DMO), are challenging since the sampling space is time‐ and space‐varying. Therefore, the spatiotemporal property of evolutionary information needs to be considered in the DMO.
Qinqin Fan   +3 more
wiley   +1 more source

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

open access: yesCommunications 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   +3 more
wiley   +1 more source

Reduced-Rank Adaptive Filtering Using Krylov Subspace

open access: yesEURASIP Journal on Advances in Signal Processing, 2002
A unified view of several recently introduced reduced-rank adaptive filters is presented. As all considered methods use Krylov subspace for rank reduction, the approach taken in this work is inspired from Krylov subspace methods for iterative solutions ...
Burykh Sergueï, Abed-Meraim Karim
doaj   +1 more source

Stochastic Subspace Method for Experimental Modal Analysis

open access: yesMATEC Web of Conferences, 2016
The formula of stochastic subspace identification method is deduced in details and the program is written out. The two methods are verified by a vibration test on a 5-floor rigid frame model.
Liu Dazhi   +5 more
doaj   +1 more source

Random finite element analysis on ground subsidence caused by tunnel excavation in karst regions with spatial variable soil

open access: yesDeep Underground Science and Engineering, EarlyView.
This study investigates ground subsidence during tunnel excavation in karst areas, highlighting the combined effects of karst cave proximity, cave size, and soil spatial variability. Findings suggest that shorter cave distances and larger cave sizes increase subsidence variability, and a modified Peck formula is proposed for more accurate subsidence ...
Zhenghong Su   +4 more
wiley   +1 more source

Subspace structural constraint-based discriminative feature learning via nonnegative low rank representation.

open access: yesPLoS ONE, 2019
Feature subspace learning plays a significant role in pattern recognition, and many efforts have been made to generate increasingly discriminative learning models.
Ao Li   +6 more
doaj   +1 more source

Thalamic connectivity mirrors spatial maps of network dysfunction in nonlesional focal epilepsy

open access: yesEpilepsia, EarlyView.
Abstract Objective Focal epilepsy is increasingly conceptualized as a network disorder, yet the extent to which network dysfunction reflects a shared phenotype remains unknown. Spatially conserved patterns of network dysfunction may implicate a centralized mechanism underlying widespread impairment.
Joline M. Fan   +7 more
wiley   +1 more source

Coupled Clustering in Hierarchical Matrices for the Oseen Problem

open access: yesInternational Journal for Numerical Methods in Fluids, EarlyView.
Fluid flow problems can be modelled by the Navier‐Stokes or, after linearization, by the Oseen equations. Their discretization results in linear systems in saddle point form which are typically very large and need to be solved iteratively. We propose a novel block structure for hierarchical matrices which is then used to build preconditioners for the ...
Jonas Grams, Sabine Le Borne
wiley   +1 more source

Home - About - Disclaimer - Privacy