-
Notifications
You must be signed in to change notification settings - Fork 0
/
lib_lu_solve.py
53 lines (44 loc) · 1.04 KB
/
lib_lu_solve.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
# coding: UTF-8
import math
import cmath
import random
import scipy.linalg as slinalg
import numpy.linalg as linalg
import numpy as np
import lu
#------------------------------------
# function definition
#------------------------------------
def direct_solver(a,b):
return slinalg.solve(a,b)
def direct_lu_solver(a,b):
lup = slinalg.lu_factor(a)
return slinalg.lu_solve(lup,b)
def plu(a,b):
(size,_) = a.shape
(lu,p) = slinalg.lu_factor(a)
l = np.zeros((size,size), dtype=np.complex128)
u = np.zeros((size,size), dtype=np.complex128)
for i in range(0,size):
l[i,i] = 1
for j in range(0,size):
if i>j:
l[i,j] = lu[i,j]
else:
u[i,j] = lu[i,j]
c = np.zeros(size, dtype=np.complex128)
for i in range(0,size):
c[i] = b[i]
for i in range(0,size):
tmp = c[i]
c[i] = c[p[i]]
c[p[i]] = tmp
return (l, u, c)
def lu_solver(a,b):
(l,u,c) = plu(a,b)
y = lu.l_step(l,c)
x = lu.u_step(u,y)
return x
#------------------------------------
# test code
#------------------------------------