| /phasta/svLS/ |
| H A D | PRECOND.f | 54 INTEGER i, j, a, b, d, Ac, faIn local 108 DO a=1, face(faIn)%nNo 109 Ac = face(faIn)%glob(a) 110 W(1:i,Ac) = W(1:i,Ac)*face(faIn)%val(1:i,a) 118 a = rowPtr(1,Ac) 120 Val(1,a:b) = Val(1,a:b)*W(1,Ac) 124 a = rowPtr(1,Ac) 126 Val(1:2,a:b) = Val(1:2,a:b)*W(1,Ac) 127 Val(3:4,a:b) = Val(3:4,a:b)*W(2,Ac) 131 a = rowPtr(1,Ac) [all …]
|
| H A D | BC.f | 52 INTEGER a, Ac, i local 77 DO a=1, nNo 78 Ac = lhs%map(gNodes(a)) 79 lhs%face(faIn)%glob(a) = Ac 83 DO a=1, nNo 84 lhs%face(faIn)%val(:,a) = Val(:,a) 91 a = 0 92 IF (lhs%face(faIn)%nNo .NE. 0) a = 1 93 CALL MPI_ALLREDUCE(a, Ac, 1, mpint, 99 DO a=1, nNo [all …]
|
| H A D | LHS.f | 52 INTEGER i, j, k, a, Ac, ai, s, e, nTasks, tF, maxnNo, ierr, local 86 a = colPtr(i) 87 IF (Ac .EQ. a) THEN 120 DO a=1, nNo 121 Ac = gNodes(a) 122 gtlPtr(Ac) = a 128 DO a=1, maxnNo 129 Ac = aNodes(a,i) 136 aNodes(a,i) = 0 139 aNodes(a,i) = 0 [all …]
|
| H A D | ADDBCMUL.f | 52 INTEGER faIn, i, a, Ac, nsd local 73 DO a=1, face(faIn)%nNo 74 Ac = face(faIn)%glob(a) 76 v(i,Ac) = face(faIn)%valM(i,a) 80 DO a=1, face(faIn)%nNo 81 Ac = face(faIn)%glob(a) 88 DO a=1, face(faIn)%nNo 89 Ac = face(faIn)%glob(a) 91 S = S + face(faIn)%valM(i,a)*X(i,Ac) 95 DO a=1, face(faIn)%nNo [all …]
|
| H A D | SOLVE.f | 54 INTEGER faIn, a, nNo, nnz, nFaces local 85 DO a=1, nNo 86 R(:,lhs%map(a)) = Ri(:,a) 115 DO a=1, nNo 116 Ri(:,a) = R(:,lhs%map(a))
|
| H A D | NSSOLVER.f | 268 INTEGER faIn, i, a, Ac local 277 DO a=1, face(faIn)%nNo 278 Ac = face(faIn)%glob(a) 280 v(i,Ac) = face(faIn)%valM(i,a) 286 DO a=1, face(faIn)%nNo 287 Ac = face(faIn)%glob(a) 290 2 face(faIn)%valM(i,a)**2D0
|
| /phasta/phSolver/compressible/ |
| H A D | get_h.c | 186 void crossProd(double a[3], double b[3], double ans[3]){ in crossProd() 187 ans[0] = a[1]*b[2]-b[1]*a[2]; in crossProd() 188 ans[1] = a[2]*b[0]-b[2]*a[0]; in crossProd() 189 ans[2] = a[0]*b[1]-b[0]*a[1]; in crossProd() 192 double dotProd(double a[3], double b[3]){ in dotProd() 193 return a[0]*b[0]+a[1]*b[1]+a[2]*b[2]; in dotProd() 196 double vecMag(double a[3]){ in vecMag() 197 return sqrt(a[0]*a[0]+a[1]*a[1]+a[2]*a[2]); in vecMag() 200 int vecEqual(double a[3], double b[3]){ in vecEqual() 201 return (a[0]==b[0] && a[1]==b[1] && a[2]==b[2]); in vecEqual()
|
| /phasta/phSolver/testIC-DSIM/ |
| H A D | geom.sdm | 115 a 14 129 4 12 1 a 130 4 12 a 3 139 a 12 5 e 140 a 12 e 7 145 0 22 g a 153 4 22 a e 157 0 24+5+a-o-l 169 5 24+j-w-a+9
|
| H A D | geom.sms | 115 a 14 129 4 12 1 a 130 4 12 a 3 139 a 12 5 e 140 a 12 e 7 145 0 23 g a 153 4 23 a e 158 0 24+5+a-o-l 170 5 24+j-w-a+9 177 0 6-a+h-2-d-6-j
|
| H A D | solver.inp | 10 # find the default values for everything that is allowed to have a 17 # parameter change. If it is a new parameter, you must 79 #from elementary operations. It works under the premise that a step is 80 #constructed from from a series of solves and updates. The table goes like
|
| /phasta/phSolver/incompressible/ |
| H A D | ftools.f | 52 subroutine fMtxVdimVecMult( a, b, c, na, nb, nc, m, n ) argument 58 real*8 a(n,na), b(n,nb), c(n,nc) local 69 c(i,1) = a(i,1) * b(i,1) 75 c(i,1) = a(i,1) * b(i,1) 76 c(i,2) = a(i,2) * b(i,2) 82 c(i,1) = a(i,1) * b(i,1) 83 c(i,2) = a(i,2) * b(i,2) 84 c(i,3) = a(i,3) * b(i,3) 90 c(i,1) = a(i,1) * b(i,1) 91 c(i,2) = a(i,2) * b(i,2) [all …]
|
| H A D | e3stab.f | 85 a + gijd(:,5) * u2 149 a + gijd(:,5) * u2 209 a + gijd(:,5) * u2 287 a + gijd(:,5) * u2 371 a + gijd(:,5) * ui(:,2) 546 a + gijd(:,5) * uMod(:,2)
|
| /phasta/phSolver/common/ |
| H A D | vec_func.h | 4 void crossProd(double a[3], double b[3], double ans[3]); 5 double dotProd(double a[3], double b[3]); 6 double vecMag(double a[3]); 7 int vecEqual(double a[3], double b[3]);
|
| H A D | newshape.cc | 424 int a,b; in HexShapeAndDrv() local 557 a = arg2[1]; in HexShapeAndDrv() 560 EdgeBlend = Hex_eB(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 563 dEBdxi = dHEBdxi1(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 564 dEBdeta = dHEBdxi2(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 565 dEBdzeta = dHEBdxi3(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 567 dEBdeta = dHEBdxi1(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 568 dEBdzeta = dHEBdxi2(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 569 dEBdxi = dHEBdxi3(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() 571 dEBdzeta = dHEBdxi1(arg,tmp1[a],tmp1[b]); in HexShapeAndDrv() [all …]
|
| H A D | fillsparse.c | 17 #define COLMAJ3D(a,b,c,amax,bmax,cmax) (a-1)+amax*((b-1)+bmax*(c-1)) argument
|
| /phasta/phSolver/AMG/ |
| H A D | amgread.txt | 4 This document is a README file for coding parallel AMG for Pressure 7 document as a help. 26 do setup everytime, ramg_control handles that. ) 2) Build a loop for 43 We have to start from this file. This is a module file containing 44 global control variables, matrices, and vectors. To have a global module 63 CF-spliting is done in a seperate function ramg_CFsplit. Other than the 66 the highest value out from the array. So heap sort is a natural choice. 68 After CF-split, we do a communication: from ramg_update_cfmap to 80 by group in parallel. For each node, there is a "group id" assigned to 82 processor. For a boundary node, if it is a "master", the rank of it is [all …]
|
| /phasta/converterIO/ |
| H A D | README.md | 19 a) converterO2N 21 Let us assume we have already generated a typical #-procs_case directory that contains phasta files… 29 which will read the PHASTA files in the #-procs_case directory and generate a new directory named #… 36 Note that PHASTA always expects a directory named #-procs_case so that the output directory #-procs… 45 It can be a tidious task to list all the fields that are essential for the PHASTA simulation. 46 No worry, there is a bash script which can generate automatically this input file, which is provide… 47 The script's name is create_IO_O2N_input.sh. Run this script a first time without any argument to l… 53 Indeed, for mixed topology meshes, there is no garantee that a single geombc file will contain all … 54 Therefore, it is strongly advised to run this script on a limited part count mesh (up to a few thou… 55 Instead, we can always recycle the same input file from a small partitioning to a large one as long… [all …]
|
| /phasta/CMakeFiles/ |
| H A D | FindMeshSim.cmake | 2 find_path(MESHSIM_LIBRARY_DIR libSimMeshing.a HINTS /usr/local/meshSim/latest /net/common/meshSim/l… 3 find_library(MESHSIM_LIBRARY libSimMeshing.a HINTS ${MESHSIM_LIBRARY_DIR} /usr/local/meshSim/latest… 4 find_library(PARASOLID_LIBRARY libpskernel.a HINTS ${MESHSIM_LIBRARY_DIR}/psKrnl /usr/local/meshSim…
|
| H A D | FindPETSC.cmake | 18 message(WARNING "and/or building PETSc as a single library") 32 find_path(PETSC_LIB libpetsc.a HINTS /usr/lib ${PETSC_PACKAGE_INCLUDES}../lib) 35 set(PETSC_LIBRARIES ${PETSC_LIB}/libpetsc.a ${PETSC_PACKAGE_LIBS})
|
| H A D | FindFMDB.cmake | 3 find_library(FMDB_LIBRARY libFMDB.a NAMES libFMDB.so HINTS "${FMDB_DIR}/lib")
|
| /phasta/phSolver/ |
| H A D | CHANGES | 16 if PARALLEL=mpich2 is specified, we also need to specify a MPICOMM type ch_shmem or 17 ch_p4. the comm type also has a -icc extension for the intel compiler based builds on 20 at the moment phasta expectes the libraries phastaIO, shapeFunction and metis to have a 25 After severe neglect we are back to version control. We start with a rollback to 1.9_7b and then b… 26 …re those contained within the download instructions. Note there is also now a directory under phSo… 32 … it gets the MKL libraries properly under their current placement. This is a temporary fix that h… 104 phasta became a function in common that is called by main in either incompressible or compressible … 105 fixed a rho scaling problem (e3lhs.f and e3stab.f) 123 specify a value of PARALLEL and potentially an MPICOMM(ch_shmem/ch_p4) 131 MPINATIVE is nolonger a valid build option, one needs to use [all …]
|
| /phasta/phSolver/cmake/ |
| H A D | GetGitRevisionDescription.cmake | 1 # - Returns a version string from Git 3 # These functions force a re-configure on each git commit so that you can 39 # to find the path to this module rather than the path to a calling list file 56 # check if this is a submodule
|
| /phasta/phSolver/incompressible/e3source/ |
| H A D | e3source.fRHSonly | 6 c currently this computes a swirl body with the axis alligned with 20 c This is the body force which will drive a swirl in a pipe flow 55 c$$$c a contrived flow in a rotating reference frame. 176 c a Lid Driven cavity flow with an analytic solution 300 c a j u a i 301 c from our notes where we had N_{a,j} = dN_a/dx_j note that i is off by one because p was first in… 400 c beta_i as a "correction" to the velocity. In calculating the 432 c a j u a i 433 c from our notes where we had N_{a,j} = dN_a/dx_j note that i is off by one because p was first in… 546 else ! NOT turbulence and NOT level set so this is a simple [all …]
|
| H A D | e3source.fimplicit | 6 c currently this computes a swirl body with the axis alligned with 20 c This is the body force which will drive a swirl in a pipe flow 55 c$$$c a contrived flow in a rotating reference frame. 176 c a Lid Driven cavity flow with an analytic solution 300 c a j u a i 301 c from our notes where we had N_{a,j} = dN_a/dx_j note that i is off by one because p was first in… 414 c beta_i as a "correction" to the velocity. In calculating the 446 c a j u a i 447 c from our notes where we had N_{a,j} = dN_a/dx_j note that i is off by one because p was first in… 560 else ! NOT turbulence and NOT level set so this is a simple [all …]
|
| /phasta/phSolver/Test_IC/ |
| H A D | solver.inp | 10 # find the default values for everything that is allowed to have a 17 # parameter change. If it is a new parameter, you must 79 #from elementary operations. It works under the premise that a step is 80 #constructed from from a series of solves and updates. The table goes like
|