Results 31 to 40 of about 32,516 (266)
A cyberlaboratory for randomized linear algebra
, 2023 A poster that describes the NSF-funded project, "A cyberlaboratory for randomized linear algebra". The poster is for the CSSI PI 2023 meeting.
Patel, Maldonado, D. Adrian
openaire +1 more source
Randomized linear algebra for model reduction. Part I: Galerkin methods and error estimation [PDF]
Advances in Computational Mathematics, 2019 We propose a probabilistic way for reducing the cost of classical projection-based model order reduction methods for parameter-dependent linear equations. A reduced order model is here approximated from its random sketch, which is a set of low-dimensional random projections of the reduced approximation space and the spaces of associated residuals. This
Oleg Balabanov, Anthony Nouy
openalex +6 more sources
Speeding up Linear Programming using Randomized Linear Algebra
, 2020 Linear programming (LP) is an extremely useful tool and has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such as combinatorics.
Chowdhury, Agniva +3 more
openaire +2 more sources
EFEKTIVITAS MODEL JIGSAW DISERTAI PENILAIAN DISKUSI UNTUK MENINGKATKAN KEMAMPUAN MATEMATIS MAHASISWA
Cakrawala Pendidikan: Jurnal Ilmiah Pendidikan, 2015 Abstrak: Penelitian ini bertujuan untuk mengetahui perbedaan peningkatan kemampuan matematis mahasiswa yang menggunakan model jigsaw disertai penilaian diskusi dengan tanpa penilaian diskusi dan perkuliahan konvensional.
Sofia Edriati +2 more
doaj +1 more source
Polynomial-Time Algorithms for Quadratic Isomorphism of Polynomials: The Regular Case [PDF]
, 2015 Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field).
Berthomieu, Jérémy +2 more
core +7 more sources
Randomized methods to characterize large-scale vortical flow networks.
PLoS ONE, 2019 We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their ...
Zhe Bai +4 more
doaj +1 more source
Polynomial time algorithms for multicast network code construction [PDF]
, 2005 The famous max-flow min-cut theorem states that a source node s can send information through a network (V, E) to a sink node t at a rate determined by the min-cut separating s and t.
Chou, Philip A. +6 more
core +2 more sources
Optimal CUR Matrix Decompositions [PDF]
, 2014 The CUR decomposition of an $m \times n$ matrix $A$ finds an $m \times c$ matrix $C$ with a subset of $c < n$ columns of $A,$ together with an $r \times n$ matrix $R$ with a subset of $r < m$ rows of $A,$ as well as a $c \times r$ low-rank matrix $U ...
Boutsidis C. +4 more
core +1 more source
Efficient Black-Box Identity Testing for Free Group Algebras [PDF]
, 2019 Hrubes and Wigderson [Pavel Hrubes and Avi Wigderson, 2014] initiated the study of noncommutative arithmetic circuits with division computing a noncommutative rational function in the free skew field, and raised the question of rational identity testing.
Arvind, V. +3 more
core +1 more source
State Determination and Sufficiency of Observables [PDF]
, 2013 Informational completeness and the possibility of state distinction and determination are among the more important issues of quantum statistics. We use spectral and semispectral (POV) measures to analyse these questions.
Lubnauer, Katarzyna +1 more
core +2 more sources