Numerical linear algebra

Lanczos algorithm

The Lanczos algorithm is an iterative method devised by Cornelius Lanczos that is an adaptation of power methods to find the "most useful" (tending towards extreme highest/lowest) eigenvalues and eigenvectors of an Hermitian matrix, where is often but not necessarily much smaller than . Although computationally efficient in principle, the method as initially formulated was not useful, due to its numerical instability. In 1970, Ojalvo and Newman showed how to make the method numerically stable and applied it to the solution of very large engineering structures subjected to dynamic loading. This was achieved using a method for purifying the Lanczos vectors (i.e. by repeatedly reorthogonalizing each newly generated vector with all previously generated ones) to any degree of accuracy, which when not performed, produced a series of vectors that were highly contaminated by those associated with the lowest natural frequencies. In their original work, these authors also suggested how to select a starting vector (i.e. use a random-number generator to select each element of the starting vector) and suggested an empirically determined method for determining , the reduced number of vectors (i.e. it should be selected to be approximately 1.5 times the number of accurate eigenvalues desired). Soon thereafter their work was followed by Paige, who also provided an error analysis. In 1988, Ojalvo produced a more detailed history of this algorithm and an efficient eigenvalue error test. (Wikipedia).

Video thumbnail

Centrality - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Newton-Raphson Algorithm in Python | Finding real and complex roots systematically

The algorithm explained: https://www.youtube.com/watch?v=qlNqPE_X4ME In this video tutorial I show you how to implement the Newton-Raphson algorithm in Python. The basic algorithm is very straightforward to implement, but there are a few tricks and things to keep in mind. In the video I s

From playlist Newton-Raphson Algorithm

Video thumbnail

Build a Heap - Intro to Algorithms

This video is part of an online course, Intro to Algorithms. Check out the course here: https://www.udacity.com/course/cs215.

From playlist Introduction to Algorithms

Video thumbnail

Introduction to Algorithms - What are they and how are they useful?

#3B1B #SoMe2 This is my submission for this year's SoME, SoME2!! I hope you enjoy, and please feel free to leave any comments. Any feedback is hugely appreciated~! ーーーーーーーーーーーーーーーーーーーーーーー Time Stamps: 00:00 Intro 00:37 Introduction to Algorithms 03:47 Exploring Algorithms - Binary Searc

From playlist Summer of Math Exposition 2 videos

Video thumbnail

Portal 2 SP Challenges [Smooth Jazz - 1 portal] 256 colors

Portal 2 challenge mode map "smooth jazz" solved with 1 portal and 256 colors in 424x240 resolution. My computer is slow, and the challenge mode does not allow recording with host_timescale, so some scripted elements (such as the lift ride) are jerky. In particular, I did _not_ walk throu

From playlist Portal & Portal 2

Video thumbnail

Portal 2 SP Challenges [Column Blocker - 4 portals] 256 colors

Portal 2 challenge mode map "column blocker" solved with 4 portals and 256 colors in 424x240 resolution. My computer is slow, and the challenge mode does not allow recording with host_timescale, so the scripted elements (including the movement of the cube when moved around) are jerky. I

From playlist Portal & Portal 2

Video thumbnail

Portal 2 SP Challenges [Incinerator - 5 portals] 256 colors

Portal 2 challenge mode map "incinerator" solved with 5 portals and 256 colors in 424x240 resolution. My computer is slow, and the challenge mode does not allow recording with host_timescale, so the scripted elements (the fall in the beginning; the cubes dropping for incineration, and the

From playlist Portal & Portal 2

Video thumbnail

What Is An Algorithm? | What Exactly Is Algorithm? | Algorithm Basics Explained | Simplilearn

This video explains what is an algorithm in the data structure. This Simplilearn's What Is An Algorithm? tutorial will help beginners to understand what exactly is an algorithm with an example. All of the algorithm basics are explained in this video. Following topics covered in this vi

From playlist Data Structures & Algorithms [2022 Updated]

Video thumbnail

Kruskals Algorithm | Kruskals Algorithm For Minimum Spanning Trees | Data Structures | Simplilearn

Don't forget to participate in challenging activity at --:-- This video on Kruskal Algorithm will acquaint you with the theoretical explanation and complete drive-through example for constructing a minimum spanning tree for given graph. This data structure tutorial will acquaint you with c

From playlist Data Structures & Algorithms

Video thumbnail

Linear Algebra 9a: Introduction to Gaussian Elimination

https://bit.ly/PavelPatreon https://lem.ma/LA - Linear Algebra on Lemma http://bit.ly/ITCYTNew - Dr. Grinfeld's Tensor Calculus textbook https://lem.ma/prep - Complete SAT Math Prep

From playlist Part 1 Linear Algebra: An In-Depth Introduction with a Focus on Applications

Video thumbnail

3D antialias illustration

This video illustrates the importance of antialiasing in 3D content. This video has the same 14-second scene rendered 4 times with different settings each time. Pay attention to the annotations. It is rendered with POV-Ray, but the technique is similar to mipmapping / anisotropic filte

From playlist Misc. productions

Video thumbnail

Dijkstra Algorithm Explained | Network Routing Using Dijkstra’s Algorithm | Simplilearn

In this video on 'What Is Dijkstra's Algorithm?', we will look into the working and the functioning of Dijkstra's algorithm, which works on the principle of the greedy algorithm. This algorithm was designed to deduce the shortest path from the primary node to the target node and design the

From playlist Networking

Video thumbnail

Jana Cslovjecsek: Efficient algorithms for multistage stochastic integer programming using proximity

We consider the problem of solving integer programs of the form min {c^T x : Ax = b; x geq 0}, where A is a multistage stochastic matrix. We give an algorithm that solves this problem in fixed-parameter time f(d; ||A||_infty) n log^O(2d) n, where f is a computable function, d is the treed

From playlist Workshop: Parametrized complexity and discrete optimization

Video thumbnail

DMRG -- Day 8

Finished the Lanczos method, moving onto DMRG on Monday! -- Watch live at https://www.twitch.tv/simuleios

From playlist DMRG

Video thumbnail

Chrono Cross Intro

Chrono Cross beginning demo. Captured using pSX, a PSX emulator. This was an interesting technical exercise, because the console uses four different resolutions and two different bitdepths in this span: 256x240, 320x240, 640x240, 640x480, and 15bpp and 32bpp. I implemented lanczos

From playlist Misc. video game videos

Video thumbnail

Half-Life 2 in low resolution [320x240]

No, I did not make it 256 colors, but I did try out as an experiment how Half-Life 2 would look like at 320x240, a very low resolution by today's standard but once rather standard for gaming. There is no point to this video except to show how it looks like at 320x240. One may immediately n

From playlist Recommended picks

Video thumbnail

Les 10 ans du Groupe Calcul - Martin Gander, Université de Genève

Martin Gander, Université de Genève "Gauss, Jacobi, Seidel, Richardson, Krylov : the Invention of Iterative Methods" The invention of iterative methods for systems of linear equations now spans almost two centuries. These methods were invented for the same reasons as they are used today,

From playlist Les 10 ans du Groupe Calcul

Video thumbnail

Ancient machine (POV-Ray animation, HD & HDRI)

This is a visual inspiration about a music soundtrack in Final Fantasy V. I did not add any sound effects; the audio is verbatim from the game's background music. I modelled and rendered this using POV-Ray, postprocessed using EXR-Utils and PFSTools, in particular using the pfstmo_fattal0

From playlist Misc. productions

Video thumbnail

Bisqwit's Duke Nukem 3D Deathmatch Map 010

A deathmatch map I designed for Duke Nukem 3D once upon a time, somewhere between 1996 and 2001, exact timespan unknown. In this video, I walk through the map, trying to discover&introduce all of its secrets. Artistic disclaimer: It is not very professional looking: Back in the day, I did

From playlist Misc. productions

Video thumbnail

Greedy Algorithm | What Is Greedy Algorithm? | Introduction To Greedy Algorithms | Simplilearn

This video on the Greedy Algorithm will acquaint you with all the fundamentals of greedy programming paradigm. In this tutorial, you will learn 'What Is Greedy Algorithm?' with the help of suitable examples. And finally, you will also discover few important applications of greedy algorithm

From playlist Data Structures & Algorithms [2022 Updated]

Related pages

Gram–Schmidt process | Krylov subspace | NAG Numerical Library | MATLAB | Characteristic polynomial | Rayleigh quotient | SciPy | Gradient | Hermitian matrix | Divide-and-conquer eigenvalue algorithm | Cornelius Lanczos | GF(2) | GNU Octave | Peter Montgomery (mathematician) | Power iteration | Numerical stability | Arnoldi iteration | Stationary point | Hamiltonian matrix | Iterative method | Householder transformation | Spectrum of a matrix | PageRank | Real number | Sparse matrix | Normal distribution | HITS algorithm | Orthonormality | Unitary matrix | Eigenvalues and eigenvectors | Tridiagonal matrix | Eigengap | Orthogonal polynomials | QR algorithm | GraphLab | Inverse iteration | Hessenberg matrix