multiplier tricks for spectral convergence
play

Multiplier tricks for spectral convergence Sabine B ogli (Imperial - PowerPoint PPT Presentation

Mar 28, 2023 •173 likes •448 views

Numerical ranges and essential numerical ranges Spectral approximation Multiplier tricks for spectral convergence Sabine B ogli (Imperial College London) Re 15 10 5 5 10 15 Quantissima III Venice, 19 August 2019 Based on joint

  1. Numerical ranges and essential numerical ranges Spectral approximation Multiplier tricks for spectral convergence Sabine B¨ ogli (Imperial College London) Re � 15 � 10 � 5 5 10 15 Quantissima III Venice, 19 August 2019 Based on joint work with M. Marletta (Cardiff): Essential numerical ranges for linear operator pencils . To appear in IMA Journal of Numerical Analysis . Sabine B¨ ogli (Imperial) Multiplier tricks

  2. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let { e k : k ∈ N } be standard ONB of l 2 ( N ) . Consider T with matrix representation �� � � − n 0 : n ∈ N = diag( − 1 , 1 , − 2 , 2 , − 3 , 3 , . . . ) . diag 0 n Re � 15 � 10 � 5 5 10 15 Sabine B¨ ogli (Imperial) Multiplier tricks

  3. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let { e k : k ∈ N } be standard ONB of l 2 ( N ) . Consider T with matrix representation �� � � − n 0 : n ∈ N = diag( − 1 , 1 , − 2 , 2 , − 3 , 3 , . . . ) . diag 0 n Re � 15 � 10 � 5 5 10 15 Compress to V n := span { e k : k = 1 , . . . , 2 n } , n ∈ N � spectral convergence. Sabine B¨ ogli (Imperial) Multiplier tricks

  4. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let { e k : k ∈ N } be standard ONB of l 2 ( N ) . Consider T with matrix representation �� � � − n 0 : n ∈ N = diag( − 1 , 1 , − 2 , 2 , − 3 , 3 , . . . ) . diag 0 n Re � 15 � 10 � 5 5 10 15 Compress to V n := span { e k : k = 1 , . . . , 2 n } , n ∈ N � spectral convergence. Let λ ∈ R \ σ ( T ) . Change ONB: span { e 2 n − 1 , e 2 n } = span { f n , g n } , f n := cos( θ n ) e 2 n − 1 + sin( θ n ) e 2 n , θ n := λ 2 n − π with 4 . g n := − sin( θ n ) e 2 n − 1 + cos( θ n ) e 2 n , Sabine B¨ ogli (Imperial) Multiplier tricks

  5. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let { e k : k ∈ N } be standard ONB of l 2 ( N ) . Consider T with matrix representation �� � � − n 0 : n ∈ N = diag( − 1 , 1 , − 2 , 2 , − 3 , 3 , . . . ) . diag 0 n Re � 15 � 10 � 5 5 10 15 Compress to V n := span { e k : k = 1 , . . . , 2 n } , n ∈ N � spectral convergence. Let λ ∈ R \ σ ( T ) . Change ONB: span { e 2 n − 1 , e 2 n } = span { f n , g n } , f n := cos( θ n ) e 2 n − 1 + sin( θ n ) e 2 n , θ n := λ 2 n − π with 4 . g n := − sin( θ n ) e 2 n − 1 + cos( θ n ) e 2 n , Then compression to H n := V n − 1 ⊕ span { f n } has eigenvalue λ n := � Tf n , f n � = n sin( λ/n ) → λ / ∈ σ ( T ) . So λ is a spurious eigenvalue (point of spectral pollution). Sabine B¨ ogli (Imperial) Multiplier tricks

  6. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let �� � � �� � � n 0 − 1 0 : n ∈ N : n ∈ N A := BT = diag , B := diag . 0 n 0 1 � ( T − λ ) f = 0 ⇐ ⇒ ( A − λB ) f = 0 (eigenvalue problem for linear pencil). Sabine B¨ ogli (Imperial) Multiplier tricks

  7. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let �� � � �� � � n 0 − 1 0 : n ∈ N : n ∈ N A := BT = diag , B := diag . 0 n 0 1 � ( T − λ ) f = 0 ⇐ ⇒ ( A − λB ) f = 0 (eigenvalue problem for linear pencil). ◮ Introduce essential numerical range W e ( T ) � contains all possible spurious eigenvalues obtained by projection methods. Here: W e ( T ) = R . Sabine B¨ ogli (Imperial) Multiplier tricks

  8. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let �� � � �� � � n 0 − 1 0 : n ∈ N : n ∈ N A := BT = diag , B := diag . 0 n 0 1 � ( T − λ ) f = 0 ⇐ ⇒ ( A − λB ) f = 0 (eigenvalue problem for linear pencil). ◮ Introduce essential numerical range W e ( T ) � contains all possible spurious eigenvalues obtained by projection methods. Here: W e ( T ) = R . ◮ Introduce essential numerical range W e ( A, B ) � contains all possible spurious eigenvalues obtained by projection methods. Here: W e ( A, B ) = ∅ . Sabine B¨ ogli (Imperial) Multiplier tricks

  9. Numerical ranges and essential numerical ranges Spectral approximation Motivation Let �� � � �� � � n 0 − 1 0 : n ∈ N : n ∈ N A := BT = diag , B := diag . 0 n 0 1 � ( T − λ ) f = 0 ⇐ ⇒ ( A − λB ) f = 0 (eigenvalue problem for linear pencil). ◮ Introduce essential numerical range W e ( T ) � contains all possible spurious eigenvalues obtained by projection methods. Here: W e ( T ) = R . ◮ Introduce essential numerical range W e ( A, B ) � contains all possible spurious eigenvalues obtained by projection methods. Here: W e ( A, B ) = ∅ . In example: no spectral pollution occurs if we calculate eigenvalues λ n given by ( A H n − λ n B H n ) f n = 0 . Sabine B¨ ogli (Imperial) Multiplier tricks

  10. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Numerical ranges for operators and linear operator pencils Let H be a Hilbert space and let A be a linear operator in H . Recall: The numerical range of A is the convex set W ( A ) = {� Af, f � : f ∈ D ( A ) , � f � = 1 } . Then σ app ( A ) ⊆ W ( A ) with σ app ( A ) := { λ ∈ C : ∃ ( f n ) n ∈ N ⊂ D ( A ) , � f n � = 1 , � ( A − λ ) f n � → 0 } . Sabine B¨ ogli (Imperial) Multiplier tricks

  11. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Numerical ranges for operators and linear operator pencils Let H be a Hilbert space and let A be a linear operator in H . Recall: The numerical range of A is the convex set W ( A ) = {� Af, f � : f ∈ D ( A ) , � f � = 1 } . Then σ app ( A ) ⊆ W ( A ) with σ app ( A ) := { λ ∈ C : ∃ ( f n ) n ∈ N ⊂ D ( A ) , � f n � = 1 , � ( A − λ ) f n � → 0 } . Now study linear pencil λ �→ A − λB with B another linear operator. Define σ ( A, B ) := { λ ∈ C : 0 ∈ σ ( A − λB ) } (and various parts analogously) and � � λ ∈ C : 0 ∈ W ( A − λB ) W ( A, B ) := . Then σ app ( A, B ) ⊆ W ( A, B ) . Sabine B¨ ogli (Imperial) Multiplier tricks

  12. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Essential numerical ranges for operators and linear operator pencils The essential numerical range of A is the convex set � � w W e ( A ) = n →∞ � Af n , f n � : f n ∈ D ( A ) , � f n � = 1 , f n lim → 0 . Then σ e ( A ) ⊆ W e ( A ) ⊆ W ( A ) with w σ e ( A ) := { λ ∈ C : ∃ ( f n ) n ∈ N ⊂ D ( A ) , � f n � = 1 , f n → 0 , � ( A − λ ) f n � → 0 } . Sabine B¨ ogli (Imperial) Multiplier tricks

  13. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Essential numerical ranges for operators and linear operator pencils The essential numerical range of A is the convex set � � w W e ( A ) = n →∞ � Af n , f n � : f n ∈ D ( A ) , � f n � = 1 , f n lim → 0 . Then σ e ( A ) ⊆ W e ( A ) ⊆ W ( A ) with w σ e ( A ) := { λ ∈ C : ∃ ( f n ) n ∈ N ⊂ D ( A ) , � f n � = 1 , f n → 0 , � ( A − λ ) f n � → 0 } . For linear pencils: � � W e ( A, B ) := λ ∈ C : 0 ∈ W e ( A − λB ) . Then σ e ( A, B ) ⊆ W e ( A, B ) ⊆ W ( A, B ) . Sabine B¨ ogli (Imperial) Multiplier tricks

  14. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Essential numerical range FOR OPERATORS ◮ W e ( T ) is closed and convex with W e ( T ) ⊇ conv( σ e ( T )) . Sabine B¨ ogli (Imperial) Multiplier tricks

  15. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Essential numerical range FOR OPERATORS ◮ W e ( T ) is closed and convex with W e ( T ) ⊇ conv( σ e ( T )) . ◮ Salinas (1972): T bounded and hypo-normal ( T ∗ T − TT ∗ ≥ 0 ) = ⇒ W e ( T ) = conv( σ e ( T )) . Sabine B¨ ogli (Imperial) Multiplier tricks

  16. Numerical ranges and essential numerical ranges Definition and basic properties of numerical ranges Spectral approximation Definition and basic properties of essential numerical ranges Essential numerical range FOR OPERATORS ◮ W e ( T ) is closed and convex with W e ( T ) ⊇ conv( σ e ( T )) . ◮ Salinas (1972): T bounded and hypo-normal ( T ∗ T − TT ∗ ≥ 0 ) = ⇒ W e ( T ) = conv( σ e ( T )) . ◮ With Marletta and Tretter: If T is selfadjoint and unbounded, then W e ( T ) = conv( � σ e ( T )) \{±∞} , where the extended essential spectrum � σ e ( T ) is defined as σ e ( T ) with −∞ ( + ∞ ) added if T is unbounded below (above). Sabine B¨ ogli (Imperial) Multiplier tricks

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Spectral Convergence of Neumann Laplacian on Non-Compact Quasi-One-Dimensional Spaces and Some

Spectral Convergence of Neumann Laplacian on Non-Compact Quasi-One-Dimensional Spaces and Some

INTRODUCTION PRELIMINARIES (APPENDIX A of [1]) GRAPH-LIKE MANIFOLDS EXAMPLES AND APPLICATIONS OF SPECTRAL Spectral Convergence of Neumann Laplacian on Non-Compact Quasi-One-Dimensional Spaces and Some Geometric Domains LY HONG HAI

545 views • 53 slides
Convergence of spectral measures and eigenvalue rigidity Elizabeth Meckes Case Western Reserve

Convergence of spectral measures and eigenvalue rigidity Elizabeth Meckes Case Western Reserve

Convergence of spectral measures and eigenvalue rigidity Elizabeth Meckes Case Western Reserve University ICERM, March 1, 2018 Macroscopic scale: the empirical spectral measure Macroscopic scale: the empirical spectral measure Suppose that M

618 views • 60 slides
Perturbations of manifolds and spectral convergence Olaf Post Mathematik (Fachbereich 4),

Perturbations of manifolds and spectral convergence Olaf Post Mathematik (Fachbereich 4),

Perturbations of manifolds and spectral convergence Olaf Post Mathematik (Fachbereich 4), Universit at Trier, Germany joint work with Colette Ann e (Nantes, France) and Andrii Khrabustovskyi (Graz) 2019-03-01 Differential Operators on

129 views • 12 slides
Approximation of Laplacians on the Sierpinski Gasket: norm-resolvent and spectral convergence Jan

Approximation of Laplacians on the Sierpinski Gasket: norm-resolvent and spectral convergence Jan

Approximation of Laplacians on the Sierpinski Gasket: norm-resolvent and spectral convergence Jan Simmer joint work with Olaf Post University of Trier February 28, 2019 5th level iteration of the Sierpsinski Gasket The Sierpinski Gasket

414 views • 30 slides
Axiomatic Foundations of Multiplier Preferences Tomasz Strzalecki Multiplier preferences

Axiomatic Foundations of Multiplier Preferences Tomasz Strzalecki Multiplier preferences

Axiomatic Foundations of Multiplier Preferences Tomasz Strzalecki Multiplier preferences Expected Utility inconsistent with observed behavior We (economists) may not want to fully trust any probabilistic model. Hansen and Sargent:

879 views • 84 slides
Spectral Frank-Wolfe Algorithm: Strict Complementarity and Linear Convergence Lijun Ding Joint

Spectral Frank-Wolfe Algorithm: Strict Complementarity and Linear Convergence Lijun Ding Joint

Spectral Frank-Wolfe Algorithm: Strict Complementarity and Linear Convergence Lijun Ding Joint work with Yingjie Fei, Qiantong Xu, and Chengrun Yang June 15, 2020 Lijun Ding (Cornell University) SpecFW June 15, 2020 1 / 17 Overview

949 views • 64 slides
Verilog Modeling for Synthesis Multiplier Design (Nelson model) Add and shift binary

Verilog Modeling for Synthesis Multiplier Design (Nelson model) Add and shift binary

Verilog Modeling for Synthesis Multiplier Design (Nelson model) Add and shift binary multiplication System Example: 8x8 multiplier Multiplicand Multiplier LoadM multiplicand (M) Start Clock Q 0 controller (C) adder (ADR) Done

270 views • 14 slides
Spectral Clustering Spectral Clustering? Spectral methods Methods using eigenvectors of

Spectral Clustering Spectral Clustering? Spectral methods Methods using eigenvectors of

Spectral Clustering Spectral Clustering? Spectral methods Methods using eigenvectors of some matrices Involve eigen-decomposition (or spectral decomposition) Seungjin Choi Spectral clustering methods: Algorithms that cluster data

501 views • 10 slides
DIAMETER PHOTO-MULTIPLIER TUBES DEREK BOYLAN PHOTO-MULTIPLIER TUBES (PMTS) Photomultipler

DIAMETER PHOTO-MULTIPLIER TUBES DEREK BOYLAN PHOTO-MULTIPLIER TUBES (PMTS) Photomultipler

CHARACTERIZATION OF LARGE- DIAMETER PHOTO-MULTIPLIER TUBES DEREK BOYLAN PHOTO-MULTIPLIER TUBES (PMTS) Photomultipler tubes are vacuum- tight light detectors Can detect single photons Useful in particle detectors like those in

400 views • 18 slides
Convergence of uniform subdivision Amos Ron Erice, Trapani, Sicilia, Italia, Europa September,

Convergence of uniform subdivision Amos Ron Erice, Trapani, Sicilia, Italia, Europa September,

Convergence of uniform subdivision Amos Ron Erice, Trapani, Sicilia, Italia, Europa September, 2013 Cascade and subdivision defined The challenge: provide a spectral characterization of convergence of uniform subdivision in the max-norm.

622 views • 21 slides
TEACHING OLD COMPILERS NEW TRICKS TEACHING OLD COMPILERS NEW TRICKS Transpiling C ++ 17 to C ++ 11

TEACHING OLD COMPILERS NEW TRICKS TEACHING OLD COMPILERS NEW TRICKS Transpiling C ++ 17 to C ++ 11

TEACHING OLD COMPILERS NEW TRICKS TEACHING OLD COMPILERS NEW TRICKS Transpiling C ++ 17 to C ++ 11 Tony Wasserka Meeting C ++ @ fail _ cluez 17 November 2018 WHO AM I ? WHO AM I ? Berlin - based consultant : Workflow optimization , Code

973 views • 24 slides
URP Slides for Multiplier Tables 12 April Lectures Economic Impact of Maytag Closing Economic

URP Slides for Multiplier Tables 12 April Lectures Economic Impact of Maytag Closing Economic

4/13/2010 URP Slides for Multiplier Tables 12 April Lectures Economic Impact of Maytag Closing Economic Impact of Maytag Closing Inputs Multiplier Total Financial Amount in Direct Indirect Induced Total (Type I) Multiplier Millions

518 views • 15 slides
TRICKS AND TRAPS OF THE CO-OPS ACT TRICKS AND TRAPS OF THE CO-OPS ACT THE NAME TRAP a

TRICKS AND TRAPS OF THE CO-OPS ACT TRICKS AND TRAPS OF THE CO-OPS ACT THE NAME TRAP a

TRICKS AND TRAPS OF THE CO-OPS ACT TRICKS AND TRAPS OF THE CO-OPS ACT THE NAME TRAP a proposed name for a co-operative can be reserved for 90 days before incorporation if you dont incorporate within 90 days, you cannot reserve

604 views • 38 slides
Some Thoughts on MC Convergence first, would like to define what I mean two kinds of

Some Thoughts on MC Convergence first, would like to define what I mean two kinds of

Some Thoughts on MC Convergence first, would like to define what I mean two kinds of convergence - convergence = experiments all working towards using same MC generator (common basis for comparison) - convergence =

239 views • 11 slides
An Efficient Softcore Multiplier Architecture for Xilinx FPGAs 22 nd IEEE Symposium on Computer

An Efficient Softcore Multiplier Architecture for Xilinx FPGAs 22 nd IEEE Symposium on Computer

An Efficient Softcore Multiplier Architecture for Xilinx FPGAs 22 nd IEEE Symposium on Computer Arithmetic Martin Kumm, Shahid Abbas and Peter Zipf University of Kassel, Germany CONTENTS 1. State-of-the-art 2. Proposed multiplier 3.

327 views • 29 slides
VHDL Modeling for Synthesis Hierarchical Design Textbook Section 4.8: Add and Shift Multiplier

VHDL Modeling for Synthesis Hierarchical Design Textbook Section 4.8: Add and Shift Multiplier

VHDL Modeling for Synthesis Hierarchical Design Textbook Section 4.8: Add and Shift Multiplier Add and shift binary multiplication Shift & add Shift & add Shift & add System Example: 8x8 multiplier Multiplicand Multiplier

297 views • 28 slides
A generic algorithm for some optimization problems in rotagraphs and fasciagraphs Marwane

A generic algorithm for some optimization problems in rotagraphs and fasciagraphs Marwane

A generic algorithm for some optimization problems in rotagraphs and fasciagraphs Marwane BOUZNIF, Julien MONCEL, Myriam PREISSMANN Laboratoire G-SCOP 46, av Flix Viallet 38031 Grenoble Cedex www.g-scop.inpg.fr Centre National de la

674 views • 34 slides
Recent advances on the acceleration of first-order methods in convex optimization . Juan

Recent advances on the acceleration of first-order methods in convex optimization . Juan

Recent advances on the acceleration of first-order methods in convex optimization . Recent advances on the acceleration of first-order methods in convex optimization . Juan PEYPOUQUET Universidad T ecnica Federico Santa Mar a Second

1.05k views • 86 slides
Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint

Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint

Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint Marc Teboulle School of Mathematical Sciences Tel Aviv University Joint work with Ronny Luss Optimization and Statistical Learning OSL 2013

823 views • 48 slides
Physics becomes the computer Norm Margolus Physics becomes the computer Emulating Physics

Physics becomes the computer Norm Margolus Physics becomes the computer Emulating Physics

Computing Beyond Silicon Summer School Physics becomes the computer Norm Margolus Physics becomes the computer Emulating Physics Finite-state, locality, invertibility, and conservation laws Physical Worlds Incorporating

721 views • 42 slides
What does Mathematical Notation actually mean, and how can computers process it? James Davenport

What does Mathematical Notation actually mean, and how can computers process it? James Davenport

What does Mathematical Notation actually mean, and how can computers process it? James Davenport Hebron & Medlock Professor of Information Technology 1 University of Bath (U.K.) 29 January 2014 1 Thanks to many people: typesetters, editors,

318 views • 29 slides
On the regularization properties of some spectral gradient methods Daniela di Serafino

On the regularization properties of some spectral gradient methods Daniela di Serafino

On the regularization properties of some spectral gradient methods Daniela di Serafino Department of Mathematics and Physics, Second University of Naples daniela.diserafino@unina2.it contributions from R. De Asmundis, G. Landi, W.W. Hager, G.

666 views • 37 slides
INTRODUCTION TO RHYTHM YU / LAMONT MARCH 27, 2018 2 REVIEW OF VOCAL TRACT LENGTH Review

INTRODUCTION TO RHYTHM YU / LAMONT MARCH 27, 2018 2 REVIEW OF VOCAL TRACT LENGTH Review

LINGUIST 197M, SPRING 2018. CLASS 9.1 INTRODUCTION TO RHYTHM YU / LAMONT MARCH 27, 2018 2 REVIEW OF VOCAL TRACT LENGTH Review Question: Write down your inter-formant distance measurement and estimated vocal tract length on the board .

1k views • 35 slides
Open problems in coding and cryptography Grard Cohen May 2, 2012 1 / 1 Outline 1 Packings 2

Open problems in coding and cryptography Grard Cohen May 2, 2012 1 / 1 Outline 1 Packings 2

Open problems in coding and cryptography Grard Cohen May 2, 2012 1 / 1 Outline 1 Packings 2 W*M 3 Cloud encoding: packing by coverings 4 Group coverings 5 Identification 6 Frequency allocation: covering by packings 7 Witness 8 Non malleable

542 views • 41 slides

More recommend