Linear Operator Equations

  • Lumer G
  • Rosenblum M
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

This chapter is devoted to the use of Monte Carlo to numerically solve equations involving linear operators. Several discrete random walks are used to solve a system of linear algebraic equations. Both forward and adjoint approaches are introduced. Next, MC techniques using continuous random walks are used to solve Fredholm integral equations. Linear differential operators also are discussed. The continuous random walk algorithm known as “walking on spheres” is used to solve boundary value problems defined by important differential equations. In particular, Laplace, Poisson, and Helmholtz equations are studied in 2- and 3-dimensions. The use of MC for eigenvalue problems involving linear operators is discussed. Keywords: linear algebraic equation, MC for linear operators; Fredholm integral equations; linear differential equations; Laplace equation; Poisson equation; Helmholtz equation; walking on spheres.

Cite

CITATION STYLE

APA

Lumer, G., & Rosenblum, M. (1959). Linear Operator Equations. Proceedings of the American Mathematical Society, 10(1), 32. https://doi.org/10.2307/2032884

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free