Results 41 to 50 of about 502,287 (194)

Matching parton showers to NLO computations

open access: yes, 2005
We give a prescription for attaching parton showers to next-to-leading order (NLO) partonic jet cross sections in electron-positron annihilation. Our method effectively extends to NLO the scheme of Catani, Krauss, Kuhn, and Webber for matching between m ...
Davison E Soper   +13 more
core   +2 more sources

解非对称鞍点问题的广义交替分裂预处理子的一个注记(A note of generalized shift-splitting preconditioners for nonsymmetric saddle point problems)

open access: yesZhejiang Daxue xuebao. Lixue ban, 2017
Recently, CAO et al introduced a generalized shift-splitting preconditioner for saddle point problems with nonsymmetric positive definite (1, 1)-block.
ZHANGLitao(张理涛)   +2 more
doaj   +1 more source

Tracking the Splitting and Combination of Group Target With $\delta$ -Generalized Labeled Multi-Bernoulli Filter

open access: yesIEEE Access, 2019
Splitting and combination are two important events of group target motion. However, the existing tracking approaches for group target splitting and combination events suffer the problems of high-computational cost and low accuracy.
Linhai Gan, Gang Wang
doaj   +1 more source

On the exact solution of the mixed-spin Ising chain with axial and rhombic zero-field splitting parameters

open access: yes, 2010
Ground-state phase diagram of the mixed spin-$1/2$ and spin-$1$ Ising chain with axial and rhombic zero-field splitting parameters is exactly calculated within the framework of the transfer-matrix method. It is shown that the rhombic zero-field splitting
Danco, M., Strecka, J.
core   +1 more source

A Generalized Matrix Splitting Algorithm

open access: yes, 2018
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization, $\ell_1$ norm regularized optimization, and $\ell_0$ norm regularized optimization as special cases.
Yuan, Ganzhao   +3 more
openaire   +2 more sources

Qualitative analysis of matrix splitting methods

open access: yesComputers & Mathematics with Applications, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Faragó, I., Tarvainen, P.
openaire   +1 more source

New accelerated modulus-based iteration method for solving large and sparse linear complementarity problem

open access: yesJournal of Numerical Analysis and Approximation Theory
For the large and sparse linear complementarity problem, we provide a family of new accelerated modulus-based iteration methods in this article. We provide some sufficient  criteria for the convergence analysis when the  system matrix is a \(P\)-matrix ...
Bharat Kumar, Deepmala, A. K. Das
doaj   +1 more source

Splitting of Andreev levels in a Josephson junction by spin-orbit coupling

open access: yes, 2007
We consider the effect of spin-orbit coupling on the energy levels of a single-channel Josephson junction below the superconducting gap. We investigate quantitatively the level splitting arising from the combined effect of spin-orbit coupling and the ...
B. Béri   +5 more
core   +1 more source

Splitting numerical integration for matrix completion

open access: yes, 2022
Low rank matrix approximation is a popular topic in machine learning. In this paper, we propose a new algorithm for this topic by minimizing the least-squares estimation over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical gradient descent within the framework of optimization on manifolds.
openaire   +2 more sources

Efficient Preconditioning Based on Scaled Tridiagonal and Toeplitz-like Splitting Iteration Method for Conservative Space Fractional Diffusion Equations

open access: yesMathematics
The purpose of this work is to study the efficient numerical solvers for time-dependent conservative space fractional diffusion equations. Specifically, for the discretized Toeplitz-like linear system, we aim to study efficient preconditioning based on a
Xiaofeng Guo
doaj   +1 more source

Home - About - Disclaimer - Privacy