# Solving procedure for a 25-diagonal coefficient matrix: Direct numerical solutions of the three-dimensional linear Fokker-Planck equation

@article{Ujevic2006SolvingPF, title={Solving procedure for a 25-diagonal coefficient matrix: Direct numerical solutions of the three-dimensional linear Fokker-Planck equation}, author={Maximiliano Ujevic and Patricio Letelier}, journal={J. Comput. Phys.}, year={2006}, volume={215}, pages={485-505} }

## 7 Citations

### Numerical self-consistent distribution function of flattened ring models

- Physics
- 2014

We provide numerical, self-consistent distribution functions for several flat ring models by simultaneously solving the Fokker-Planck equation and the Poisson equation. In particular, we calculated…

### The approximate solutions of FPK equations in high dimensions for some nonlinear stochastic dynamic systems

- Computer Science
- 2011

The Fokker-Planck-Kolmogorov equation in low dimensions is obtained from the original FPK equation in high dimensions and it makes the problem of obtaining the probabilistic solutions of large-scale NSD systems solvable with the exponential polynomial closure method.

### Fokker–Planck–Rosenbluth-type equations for self-gravitating systems in the 1PN approximation

- Physics
- 2008

We present two formulations of Fokker–Planck–Rosenbluth-type (FPR) equations for many-particle self-gravitating systems, with first-order relativistic corrections in the post-Newtonian approach…

### Probabilistic solutions of some multi-degree-of-freedom nonlinear stochastic dynamical systems excited by filtered Gaussian white noise

- EngineeringComput. Phys. Commun.
- 2014

### Stability of general relativistic static thick disks: the isotropic Schwarzschild thick disk

- Physics
- 2007

We study the stability of general relativistic static thick disks. As an application we consider the thick disk generated by applying the “displace, cut, fill and reflect” method, usually known as…

### Analysis of some large-scale nonlinear stochastic dynamic systems with subspace-EPC method

- Engineering
- 2011

The probabilistic solutions to some nonlinear stochastic dynamic (NSD) systems with various polynomial types of nonlinearities in displacements are analyzed with the subspace-exponential polynomial…

### Stability of general relativistic Miyamoto–Nagai galaxies

- Physics
- 2007

The stability of a recently proposed general relativistic model of galaxies is studied in some detail. This model is a general relativistic version of the well-known Miyamoto-Nagai model that…

## References

SHOWING 1-10 OF 35 REFERENCES

### Vectorized strongly implicit solving procedure for a seven‐diagonal coefficient matrix

- Computer Science
- 1994

The paper presents an extension of Stone’s strongly implicit procedure for solving linear equation systems resulting from the discretization of partial differential equations to three‐dimensional problems which allows vector processing on modern supercomputers, in spite of its recursive structure.

### Numerical self-consistent stellar models of thin disks

- Physics
- 2005

We find a numerical self-consistent stellar model by finding the distribution function of a thin disk that satisfies simultaneously the FokkerPlanck and Poisson equations. The solution of the…

### ITERATIVE SOLUTION OF IMPLICIT APPROXIMATIONS OF MULTIDIMENSIONAL PARTIAL DIFFERENTIAL EQUATIONS

- Mathematics
- 1968

Summary. A new iterative method has been developed for solving the large sets of algebraic equations that arise in the approximate solution of multidimensional partial differential equations by…

### A MODIFIED STRONGLY IMPLICIT PROCEDURE FOR THE NUMERICAL SOLUTION OF FIELD PROBLEMS

- Mathematics
- 1981

A modified strongly implicit procedure for solving the system of algebraic equations that arise in the finite-difference or finite-analytic description of field problems is presented. The method is…

### The principle of minimized iterations in the solution of the matrix eigenvalue problem

- Mathematics
- 1951

An interpretation of Dr. Cornelius Lanczos' iteration method, which he has named "minimized iterations", is discussed in this article, expounding the method as applied to the solution of the…

### An iteration method for the solution of the eigenvalue problem of linear differential and integral operators

- Mathematics
- 1950

The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of…

### Methods of conjugate gradients for solving linear systems

- Mathematics, Computer Science
- 1952

An iterative algorithm is given for solving a system Ax=k of n linear equations in n unknowns and it is shown that this method is a special case of a very general method which also includes Gaussian elimination.

### Solution of Systems of Linear Equations by Minimized Iterations1

- Mathematics
- 1952

In an earlier publication [14] a method was described which generated the eigenvalues and eigenvectors of a matrix by a successive algorithm based on minimizations by least squares. The advantage of…