نتایج جستجو برای: componentwise linear module
تعداد نتایج: 545499 فیلتر نتایج به سال:
For a class of uncertain nonlinear systems (UNSs), the flow-invariance of a timedependent rectangular set (TDRS) defines individual constraints for each component of the state-space trajectories. It is shown that the existence of the flowinvariance property is equivalent to the existence of positive solutions for some differential inequalities with constant coefficients (derived from the state-...
We survey recent developments in dense numerical linear algebra, covering linear systems, least squares problems and eigenproblems. Topics considered include the design and analysis of block, partitioned and parallel algorithms, condition number estimation, componentwise error analysis, and the computation of practical error bounds. Frequent reference is made to LAPACK, the state of the art pac...
We describe a combinatorial condition on graphwhich guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated by Eagon and Reiner’s Theorem we study whether the Cohen-Macaulay graph have linear free resolutions. After giving complete characterization cactus graphs (i.e., connected in which each edge belongs to at most one cycle) show their ideals
We show that attaching a whisker (or pendant) at the vertices of cycle cover graph results in new with following property: all symbolic powers its ideal are Koszul or, equivalently, componentwise linear. This extends previous work where whiskers were added to or vertex graph.
Quasi-stable ideals appear as leading ideals in the theory of Pommaret bases. We show that quasi-stable leading ideals share many of the properties of the generic initial ideal. In contrast to genericity, quasistability is a characteristic independent property that can be effectively verified. We also relate Pommaret bases to some invariants associated with local cohomology, exhibit the existen...
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Separable) linear codes over finite fields is generalized to MDS group codes over abelian groups, using the notion of quasideterminants defined for matrices over non-commutative rings.
SUMMARY The R add-on package mboost implements functional gradient descent algorithms (boosting) for optimizing general loss functions utilizing componentwise least squares, either of parametric linear form or smoothing splines, or regression trees as base learners for fitting generalized linear, additive and interaction models to potentially high-dimensional data. AVAILABILITY Package mboost...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید