Results 191 to 200 of about 221 (205)
Some of the next articles are maybe not open access.
Vertex-Centered Linearity-Preserving Schemes for Nonlinear Parabolic Problems on Polygonal Grids
Journal of Scientific Computing, 2016A family of vertex-centered finite volume schemes is constructed for the numerical solution of highly nonlinear parabolic equations with applications to radiation hydrodynamics and magneto hydrodynamics. The primary unknowns are defined at the cell vertices and the derivation of the scheme is performed through a linearity preserving approach.
openaire +2 more sources
A vertex‐centered linearity‐preserving discretization of diffusion problems on polygonal meshes
International Journal for Numerical Methods in Fluids, 2015SummaryThis paper introduces a vertex‐centered linearity‐preserving finite volume scheme for the heterogeneous anisotropic diffusion equations on general polygonal meshes. The unknowns of this scheme are purely the values at the mesh vertices, and no auxiliary unknowns are utilized.
Jiming Wu, Zhiming Gao, Zihuan Dai
openaire +1 more source
A Family of Linearity-Preserving Schemes for Anisotropic Diffusion Problems on General Grids
Journal of Computational and Theoretical Transport, 2016ABSTRACTWe propose a new family of cell-centered finite volume schemes with compact stencils for anisotropic diffusion problems on arbitrary polygonal grids. The derivation of the schemes is based on a general framework through a certain linearity-preserving approach, so that piecewise linear solutions are preserved. These schemes have only one primary
Longshan Luo, Jiming Wu, Zhiming Gao
openaire +1 more source
Weakening the conditions in some classical theorems on linear preserver problems
Linear and Multilinear Algebra, 2015Linear preserver problems concern the study of linear maps on matrices or operators preserving special properties. In all previous results, one needs to know certain information of the maps on an infinite number of matrices to characterize the structures of a class of linear preservers.
openaire +1 more source
Computer Methods in Applied Mechanics and Engineering, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sun, Weiwei, Wu, Jiming, Zhang, Xiaoping
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sun, Weiwei, Wu, Jiming, Zhang, Xiaoping
openaire +1 more source
Optimization Methods and Software, 2012
The minimum edge count (MEC) and optimal Jacobian accumulation problems in linearized directed acyclic graphs (DAGs) result from the combinatorics induced by the associativity of the chain rule of differential calculus. This paper discusses a suitable graph formalism followed by proving a number of results that yield a considerable search space ...
Viktor Mosenkis, Uwe Naumann
openaire +1 more source
The minimum edge count (MEC) and optimal Jacobian accumulation problems in linearized directed acyclic graphs (DAGs) result from the combinatorics induced by the associativity of the chain rule of differential calculus. This paper discusses a suitable graph formalism followed by proving a number of results that yield a considerable search space ...
Viktor Mosenkis, Uwe Naumann
openaire +1 more source
Weakening the conditions in some classical theorems on linear preserver problems
Linear and Multilinear Algebra, 2016Zejun Huang
exaly
A structure-preserving algorithm for the linear lossless dissipative Hamiltonian eigenvalue problem
Annals of Mathematical Sciences and Applications, 2022openaire +1 more source
A Generalization of Strongly Preserver Problems of Drazin Invertibility
Acta Mathematica Vietnamica, 2018Mourad Oudghiri
exaly

