Related papers: Metodi Iterativi per Sistemi Lineari
These are the notes for a 5-lecture-course given at ESSLLI 2006 in Malaga, Spain. The URL of the school is http://esslli2006.lcc.uma.es/ . This version slightly differs from the one which has been distributed at the school because typos…
This is a set of lecture notes introducing graduate students to the topic of Discontinuous Petrov-Galerkin (DPG) methods.
In the paper [Muhammad Aslam Noor, Khalida Inayat Noor, Three-step iterative methods for nonlinear equations, Applied Mathematics and Computation, 183 (2006), pp. 322-327 ], Authors presented an algorithm (\textbf{Algorithm 2.3}) and stated…
This is an expanded set of notes based on two lectures given by the author at the 2022 IHES summer school on the Langlands program, on explicit techniques for the construction of automorphic representations.
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
These lecture notes provide a self-contained introduction to the mathematical methods required in a Bachelor degree programme in Business, Economics, or Management. In particular, the topics covered comprise real-valued vector and matrix…
These lectures were a part of the geometry course held during the Fall 2011 Mathematics Advanced Study Semesters (MASS) Program at Penn State (\url{http://www.math.psu.edu/mass/}). The lectures are meant to be accessible to advanced…
Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
Here I share a few notes I used in various course lectures, talks, etc. Some may be just calculations that in the textbooks are more complicated, scattered, or less specific; others may be simple observations I found useful or curious.
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
This paper presents a probabilistic perspective on iterative methods for approximating the solution $\mathbf{x}_* \in \mathbb{R}^d$ of a nonsingular linear system $\mathbf{A} \mathbf{x}_* = \mathbf{b}$. In the approach a standard iterative…
As we stride toward the exascale era, due to increasing complexity of supercomputers, hard and soft errors are causing more and more problems in high-performance scientific and engineering computation. In order to improve reliability…
This volume contains a selection of papers presented at Linearity/TLLA 2018: Joint Linearity and TLLA workshops (part of FLOC 2018) held on July 7-8, 2018 in Oxford. Linearity has been a key feature in several lines of research in both…
This is a concise mathematical introduction to Monte Carlo methods, a rich family of algorithms with far-reaching applications in science and engineering. Monte Carlo methods are an exciting subject for mathematical statisticians and…
Linear typed $\lambda$-calculi are more delicate than their simply typed siblings when it comes to metatheoretic results like preservation of typing under renaming and substitution. Tracking the usage of variables in contexts places more…
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…
This is a survey on the subject of the title corresponding to three lectures I gave in June 2001 at the Workshop on Fourier Analysis and Convexity, at the Universita di Milano-Biccoca.
The present notes are based on a course on Cherednik algebras given by the first author at MIT in the Fall of 2009. Their goal is to give an introduction to Cherednik algebras, and to review the web of connections between them and other…
In this paper, a residual-type a posteriori error estimator is proposed and analyzed for a modified weak Galerkin finite element method solving linear elasticity problems. The estimator is proven to be both reliable and efficient because it…