Results 241 to 250 of about 328,395 (278)
Some of the next articles are maybe not open access.
Implicit Block Diagonal Low-Rank Representation
IEEE Transactions on Image Processing, 2018While current block diagonal constrained subspace clustering methods are performed explicitly on the original data space, in practice, it is often more desirable to embed the block diagonal prior into the reproducing kernel Hilbert feature space by kernelization techniques, as the underlying data structure in reality is usually nonlinear.
Xingyu Xie +3 more
openaire +3 more sources
Construction of A -Stable Diagonally Implicit Multivalue Methods
SIAM Journal on Numerical Analysis, 1989This paper examines two families of diagonally implicit methods with s internal and r external stages based on the Nordsieck approach and the multistep Runge–Kutta approach. Two general classes of methods are constructed both with order $r + 1$ and stage order $r - 1$.
Burrage, Kevin, Chipman, Fred
openaire +1 more source
Singly diagonally implicit multivalue collocation methods
2020 International Conference on Mathematics and Computers in Science and Engineering (MACISE), 2020The purpose of this work is to derive a family of multivalue collocation methods for the numerical solution of ordinary differential equations. The methods are characterized by a lower triangular coefficient matrix of the nonlinear system for the computation of the stages, with all equal diagonal entries.
Conte, Dajana +3 more
openaire +1 more source
Diagonally implicit Runge–Kutta methods for stiff ODEs
Applied Numerical Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kennedy, Christopher A. +1 more
openaire +1 more source
Diagonally Implicit RK Methods
1996We continue to quote from this nice paper: “To integrate a system of n differential equations, an implicit method with a full s × s matrix requires the solution of ns simultaneous implicit (in general nonlinear) equations in each time step (...) One way to circumvent this difficulty is to use a lower triangular matrix (a ij )(i.e., a matrix with a ij =
Ernst Hairer, Gerhard Wanner
openaire +1 more source
Diagonal inversion of lower-upper implicit schemes
AIAA Journal, 1990A new diagonally inverted lower-upper (LU) implicit scheme is developed for the three-dimensional Euler equations. The matrix systems that are to be inverted in the scheme are treated by local diagonalizing transformations that decouple them into systems of scalar equations.
Jeffrey W. Yokota +2 more
openaire +1 more source
29th AIAA, Fluid Dynamics Conference, 1998
A diagonal form of the recently developed diagonal dominant alternating direction implicit scheme for solving the Navier-Stokes equations is presented. The diagonally dominant scheme with a subiteration procedure eliminates the factorization error and therefore the scheme is more robust.
Goetz Klopfer +3 more
openaire +1 more source
A diagonal form of the recently developed diagonal dominant alternating direction implicit scheme for solving the Navier-Stokes equations is presented. The diagonally dominant scheme with a subiteration procedure eliminates the factorization error and therefore the scheme is more robust.
Goetz Klopfer +3 more
openaire +1 more source
A diagonal form of an implicit approximate-factorization algorithm
Journal of Computational Physics, 1981A modification of an implicit approximate-factorization finite-difference algorithm applied to partial differential equations is presented. This algorithm is applied to the two- and three-dimensional Euler equations in general curvilinear coordinates.
Pulliam, T. H., Chaussee, D. S.
openaire +1 more source
Diagonal implicit multigrid calculation of inlet flowfields
AIAA Journal, 1989Extension au calcul de l'ecoulement supersonique sur et dans une entree plane ...
D. A. Caughey, R. K. lyer
openaire +1 more source
Diagonal implicit multigrid algorithm for the Euler equations
AIAA Journal, 1987A multigrid implementation of the alternating direction implicit algorithm has been developed to solve the Euler equations of inviscid, compressible flow. The equations are approximated using a finite-volume spatial discretization with added dissipation provided by an adaptive blend of second and fourth differences.
openaire +1 more source

