Results 101 to 110 of about 12,308 (240)

Constructing symmetric structure-preserving strong linearizations

open access: yes, 2016
Polynomials eigenvalue problems with structured matrix polynomials arise in many applications. The standard way to solve polynomial eigenvalue problems is through the classical Frobenius companion linearizations, which may not retain the structure of the
Perez Alvaro, Javier   +2 more
core   +1 more source

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

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

Bayesian and maximin optimal designs for heteroscedastic regression models [PDF]

open access: yes
The problem of constructing standardized maximin D-optimal designs for weighted polynomial regression models is addressed. In particular it is shown that, by following the broad approach to the construction of maximin designs introduced recently by Dette,
Dette, Holger   +2 more
core  

Subspace Acceleration for Efficient Nonlinear Water Wave Simulation

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

Nonparametric Estimation and Symmetry Tests for Conditional Density Functions. [PDF]

open access: yes
We suggest two new methods for conditional density estimation. The first is based on locally fitting a log-linear model, and is in the spirit of recent work on locally parametric techniques in density estimation.
Hyndman, R.J., Yao, Q.
core  

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

open access: yesInfoScience, 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   +6 more
wiley   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

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

The Symmetric Derivative and Related Operators for Symmetric Forms with Polynomial Coefficients in Rn

open access: yes
The symmetric derivative and related operators for symmetric forms with polynomial coefficients in Rn are investigated. The adjoints of these operators, with respect to the scalar product for symmetric forms with polynomial coefficients, are found and ...
Anna Kimaczyńska
core   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

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

On the Hardness of Switching to a Small Number of Edges

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

Home - About - Disclaimer - Privacy