Photo from archive.org
Sign Up to like & get
recommendations!
0
Published in 2020 at "Combinatorica"
DOI: 10.1007/s00493-019-3897-3
Abstract: Let A be a random m × n matrix over the finite field $$\mathbb{F}_q$$ F q with precisely k non-zero entries per row and let $$y\in\mathbb{F}_q^m$$ y ∈ F q m be a random vector…
read more here.
Keywords:
random linear;
threshold random;
satisfiability threshold;
geometry ... See more keywords
Photo from archive.org
Sign Up to like & get
recommendations!
0
Published in 2018 at "Journal of Differential Equations"
DOI: 10.1016/j.jde.2018.01.002
Abstract: Abstract We provide necessary and sufficient conditions for which an nth-order linear differential equation has a general polynomial solution. We also give necessary conditions that can directly be ascertained from the coefficient functions of the…
read more here.
Keywords:
polynomial solutions;
linear equations;
general polynomial;
equations general ... See more keywords
Photo from academic.microsoft.com
Sign Up to like & get
recommendations!
0
Published in 2017 at "Ergodic Theory and Dynamical Systems"
DOI: 10.1017/etds.2016.137
Abstract: Given an algebraic $\mathbf{Z}^{d}$ -action corresponding to a prime ideal of a Laurent ring of polynomials in several variables, we show how to find the smallest order $n+1$ of non-mixing. It is known that this…
read more here.
Keywords:
groups recurrences;
mixing iii;
recurrences mixing;
linear equations ... See more keywords
Photo from academic.microsoft.com
Sign Up to like & get
recommendations!
0
Published in 2018 at "International Mathematics Research Notices"
DOI: 10.1093/imrn/rny216
Abstract: We establish an effective version of the André–Oort conjecture for linear subspaces of $Y(1)^n_{\mathbb{C}} \approx \mathbb{A}_{\mathbb{C}}^n$. This gives the first effective nontrivial results of André–Oort type for higher-dimensional varieties in products of modular curves.
read more here.
Keywords:
equations singular;
singular moduli;
linear equations;
Photo by garri from unsplash
Sign Up to like & get
recommendations!
3
Published in 2022 at "Computational Intelligence and Neuroscience"
DOI: 10.1155/2022/3411959
Abstract: With the continuous reform and innovation of Internet technology and the continuous development and progress of social economy, Big Data cloud computing technology is more and more widely used in people's work and life. Many…
read more here.
Keywords:
task scheduling;
decision scheduling;
large linear;
solving large ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Bulletin of Electrical Engineering and Informatics"
DOI: 10.11591/eei.v8i2.1420
Abstract: Nowadays, Vehicular Ad-Hoc Network (VANET) has got more attention from the researchers. The researchers have studied numerous topics of VANET, such as the routing protocols of VANET and the MAC protocols of VANET. The aim…
read more here.
Keywords:
non linear;
newton raphson;
raphson method;
linear equations ... See more keywords
Photo by nci from unsplash
Sign Up to like & get
recommendations!
1
Published in 2022 at "PLoS ONE"
DOI: 10.1371/journal.pone.0265547
Abstract: Central to cognitive load theory is the concept of element interactivity, which reflects the complexity of material. The complexity of linear equations depends on the number of operational and relational lines and the nature of…
read more here.
Keywords:
step;
operation;
linear equations;
balance ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Open Mathematics"
DOI: 10.1515/math-2019-0125
Abstract: Abstract In this paper we investigate theoretically and numerically the new preconditioned method to accelerate over-relaxation (AOR) and succesive over-relaxation (SOR) schemes, which are used to the large sparse linear systems. The iterative method that…
read more here.
Keywords:
preconditioned aor;
method;
iterative scheme;
linear equations ... See more keywords
Photo from wikipedia
Sign Up to like & get
recommendations!
1
Published in 2018 at "Hacettepe Journal of Mathematics and Statistics"
DOI: 10.15672/hjms.2018.561
Abstract: The Lanczos-type algorithms for Systems of Linear Equations (SLEs) are efficient but fragile. A number of ways to resolve this issue have been suggested. But, the problem is still not fully sorted, in our view.…
read more here.
Keywords:
type algorithms;
systems linear;
linear equations;
type ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2022 at "Algorithms"
DOI: 10.3390/a15020033
Abstract: There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An…
read more here.
Keywords:
boolean function;
function;
converting boolean;
equations inequalities ... See more keywords