Compare commits
72 Commits
cjy-oneapi
...
cjy-spirit
| Author | SHA1 | Date | |
|---|---|---|---|
| 0992e2219a | |||
| 0db537479b | |||
| 1f3fd264c0 | |||
| 442674cedc | |||
| 8d28c29a91 | |||
| 0cf58176d9 | |||
| 0f1d0de1e7 | |||
| b57d80ca61 | |||
| 9cd3741a90 | |||
| ac82ebd889 | |||
| 9c31384b2f | |||
| e4e741caa1 | |||
| 65e0f95f40 | |||
| f9fbf97e64 | |||
| 968522995b | |||
| f3988ac8ca | |||
| e4c25eb21f | |||
| 4b10519876 | |||
| 3a58273501 | |||
| 5c65cea2f0 | |||
| 8c1f4d8108 | |||
| d310ef918b | |||
| b35e1b289f | |||
| 05851b2c59 | |||
| 3b39583d67 | |||
| 688bdb6708 | |||
| 5070134857 | |||
| 4012e9d068 | |||
| b3c367f15b | |||
| e73911f292 | |||
| 7543d3e8c7 | |||
| 42c69fab24 | |||
| 95220a05c8 | |||
| 466b084a58 | |||
| 61ccef9f97 | |||
| e11363e06e | |||
| f70e90f694 | |||
|
|
75dd5353b0 | ||
|
|
23a82d063b | ||
| 524d1d1512 | |||
| 44efb2e08c | |||
| 16013081e0 | |||
| 03416a7b28 | |||
| cca3c16c2b | |||
| e5231849ee | |||
| a766e49ff0 | |||
| 1a518cd3f6 | |||
| 1dc622e516 | |||
| 3046a0ccde | |||
| d4ec69c98a | |||
| 2c0a3055d4 | |||
| 1eba73acbe | |||
| b91cfff301 | |||
| e29ca2dca9 | |||
| 6493101ca0 | |||
| 169986cde1 | |||
| 1fbc213888 | |||
| 6024708a48 | |||
| bc457d981e | |||
| 51dead090e | |||
| 34d6922a66 | |||
| 8010ad27ed | |||
| 38e691f013 | |||
| 808387aa11 | |||
| c2b676abf2 | |||
| 2c60533501 | |||
| 318b5254cc | |||
| 3cee05f262 | |||
| e6329b013d | |||
| 2791d2e225 | |||
| 72ce153e48 | |||
|
|
79af79d471 |
4
.gitignore
vendored
4
.gitignore
vendored
@@ -1,6 +1,6 @@
|
|||||||
__pycache__
|
__pycache__
|
||||||
GW150914
|
GW150914
|
||||||
GW150914-origin
|
GW150914*
|
||||||
docs
|
docs
|
||||||
*.tmp
|
*.tmp
|
||||||
|
.codex
|
||||||
@@ -174,11 +174,14 @@ import generate_macrodef
|
|||||||
generate_macrodef.generate_macrodef_h()
|
generate_macrodef.generate_macrodef_h()
|
||||||
print( " AMSS-NCKU macro file macrodef.h has been generated. " )
|
print( " AMSS-NCKU macro file macrodef.h has been generated. " )
|
||||||
|
|
||||||
generate_macrodef.generate_macrodef_fh()
|
generate_macrodef.generate_macrodef_fh()
|
||||||
print( " AMSS-NCKU macro file macrodef.fh has been generated. " )
|
print( " AMSS-NCKU macro file macrodef.fh has been generated. " )
|
||||||
|
|
||||||
|
generate_macrodef.generate_build_config()
|
||||||
##################################################################
|
print( " AMSS-NCKU build config AMSS_NCKU_build.mk has been generated. " )
|
||||||
|
|
||||||
|
|
||||||
|
##################################################################
|
||||||
|
|
||||||
# Compile the AMSS-NCKU program according to user requirements
|
# Compile the AMSS-NCKU program according to user requirements
|
||||||
|
|
||||||
@@ -217,11 +220,13 @@ shutil.copytree(AMSS_NCKU_source_path, AMSS_NCKU_source_copy)
|
|||||||
|
|
||||||
# Copy the generated macro files into the AMSS_NCKU source folder
|
# Copy the generated macro files into the AMSS_NCKU source folder
|
||||||
|
|
||||||
macrodef_h_path = os.path.join(File_directory, "macrodef.h")
|
macrodef_h_path = os.path.join(File_directory, "macrodef.h")
|
||||||
macrodef_fh_path = os.path.join(File_directory, "macrodef.fh")
|
macrodef_fh_path = os.path.join(File_directory, "macrodef.fh")
|
||||||
|
build_config_path = os.path.join(File_directory, "AMSS_NCKU_build.mk")
|
||||||
shutil.copy2(macrodef_h_path, AMSS_NCKU_source_copy)
|
|
||||||
shutil.copy2(macrodef_fh_path, AMSS_NCKU_source_copy)
|
shutil.copy2(macrodef_h_path, AMSS_NCKU_source_copy)
|
||||||
|
shutil.copy2(macrodef_fh_path, AMSS_NCKU_source_copy)
|
||||||
|
shutil.copy2(build_config_path, AMSS_NCKU_source_copy)
|
||||||
|
|
||||||
# Notes on copying files:
|
# Notes on copying files:
|
||||||
# shutil.copy2 preserves file metadata such as modification time.
|
# shutil.copy2 preserves file metadata such as modification time.
|
||||||
|
|||||||
@@ -1,10 +1,19 @@
|
|||||||
#!/usr/bin/env python3
|
#!/usr/bin/env python3
|
||||||
"""
|
"""
|
||||||
AMSS-NCKU GW150914 Simulation Regression Test Script
|
AMSS-NCKU GW150914 Simulation Regression Test Script (Comprehensive Version)
|
||||||
|
|
||||||
Verification Requirements:
|
Verification Requirements:
|
||||||
1. XY-plane trajectory RMS error < 1% (Optimized vs. baseline, max of BH1 and BH2)
|
1. RMS errors < 1% for:
|
||||||
2. ADM constraint violation < 2 (Grid Level 0)
|
- 3D Vector Total RMS
|
||||||
|
- X Component RMS
|
||||||
|
- Y Component RMS
|
||||||
|
- Z Component RMS
|
||||||
|
2. ADM constraint violation < 2 (Grid Level 0)
|
||||||
|
3. The following figure PDFs must match GW150914-origin exactly after rasterization:
|
||||||
|
- ADM_Constraint_Grid_Level_0.pdf
|
||||||
|
- BH_Trajectory_21_XY.pdf
|
||||||
|
- BH_Trajectory_XY.pdf
|
||||||
|
The script also reports the percentage of differing pixels for each figure.
|
||||||
|
|
||||||
RMS Calculation Method:
|
RMS Calculation Method:
|
||||||
- Computes trajectory deviation on the XY plane independently for BH1 and BH2
|
- Computes trajectory deviation on the XY plane independently for BH1 and BH2
|
||||||
@@ -16,9 +25,13 @@ Default: output_dir = GW150914/AMSS_NCKU_output
|
|||||||
Reference: GW150914-origin (baseline simulation)
|
Reference: GW150914-origin (baseline simulation)
|
||||||
"""
|
"""
|
||||||
|
|
||||||
import numpy as np
|
import numpy as np
|
||||||
import sys
|
import sys
|
||||||
import os
|
import os
|
||||||
|
import shutil
|
||||||
|
import subprocess
|
||||||
|
import tempfile
|
||||||
|
from PIL import Image
|
||||||
|
|
||||||
# ANSI Color Codes
|
# ANSI Color Codes
|
||||||
class Color:
|
class Color:
|
||||||
@@ -45,91 +58,200 @@ def load_bh_trajectory(filepath):
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
def load_constraint_data(filepath):
|
def load_constraint_data(filepath):
|
||||||
"""Load constraint violation data"""
|
"""Load constraint violation data"""
|
||||||
data = []
|
data = []
|
||||||
with open(filepath, 'r') as f:
|
with open(filepath, 'r') as f:
|
||||||
for line in f:
|
for line in f:
|
||||||
if line.startswith('#'):
|
if line.startswith('#'):
|
||||||
continue
|
continue
|
||||||
parts = line.split()
|
parts = line.split()
|
||||||
if len(parts) >= 8:
|
if len(parts) >= 8:
|
||||||
data.append([float(x) for x in parts[:8]])
|
data.append([float(x) for x in parts[:8]])
|
||||||
return np.array(data)
|
return np.array(data)
|
||||||
|
|
||||||
|
|
||||||
|
def resolve_figure_dir(path):
|
||||||
|
"""Resolve the sibling figure directory from an output or figure path."""
|
||||||
|
normalized = os.path.normpath(path)
|
||||||
|
if os.path.basename(normalized) == "figure":
|
||||||
|
return normalized
|
||||||
|
return os.path.join(os.path.dirname(normalized), "figure")
|
||||||
|
|
||||||
|
|
||||||
|
def render_pdf_to_images(pdf_path, dpi=150):
|
||||||
|
"""Render a PDF to RGB images using Ghostscript."""
|
||||||
|
gs_path = shutil.which("gs")
|
||||||
|
if gs_path is None:
|
||||||
|
raise RuntimeError("Ghostscript executable 'gs' was not found in PATH")
|
||||||
|
|
||||||
|
with tempfile.TemporaryDirectory(prefix="amss_verify_pdf_") as temp_dir:
|
||||||
|
output_pattern = os.path.join(temp_dir, "page-%03d.ppm")
|
||||||
|
cmd = [
|
||||||
|
gs_path,
|
||||||
|
"-q",
|
||||||
|
"-dSAFER",
|
||||||
|
"-dBATCH",
|
||||||
|
"-dNOPAUSE",
|
||||||
|
"-sDEVICE=ppmraw",
|
||||||
|
f"-r{dpi}",
|
||||||
|
f"-o{output_pattern}",
|
||||||
|
pdf_path
|
||||||
|
]
|
||||||
|
|
||||||
|
try:
|
||||||
|
subprocess.run(cmd, check=True, stdout=subprocess.DEVNULL, stderr=subprocess.PIPE, text=True)
|
||||||
|
except subprocess.CalledProcessError as exc:
|
||||||
|
message = exc.stderr.strip() or str(exc)
|
||||||
|
raise RuntimeError(f"Failed to render PDF '{pdf_path}': {message}") from exc
|
||||||
|
|
||||||
|
ppm_files = sorted(
|
||||||
|
os.path.join(temp_dir, filename)
|
||||||
|
for filename in os.listdir(temp_dir)
|
||||||
|
if filename.endswith(".ppm")
|
||||||
|
)
|
||||||
|
|
||||||
|
if not ppm_files:
|
||||||
|
raise RuntimeError(f"No rendered pages were produced for '{pdf_path}'")
|
||||||
|
|
||||||
|
images = []
|
||||||
|
for ppm_file in ppm_files:
|
||||||
|
with Image.open(ppm_file) as img:
|
||||||
|
images.append(np.array(img.convert("RGB"), dtype=np.uint8))
|
||||||
|
|
||||||
|
return images
|
||||||
|
|
||||||
|
|
||||||
|
def compare_rendered_pages(ref_img, target_img):
|
||||||
|
"""Return (different_pixels, total_pixels) for two rendered RGB pages."""
|
||||||
|
ref_h, ref_w = ref_img.shape[:2]
|
||||||
|
tgt_h, tgt_w = target_img.shape[:2]
|
||||||
|
total_pixels = max(ref_h, tgt_h) * max(ref_w, tgt_w)
|
||||||
|
|
||||||
|
if ref_h == tgt_h and ref_w == tgt_w:
|
||||||
|
different_pixels = int(np.count_nonzero(np.any(ref_img != target_img, axis=2)))
|
||||||
|
return different_pixels, total_pixels
|
||||||
|
|
||||||
|
diff_mask = np.ones((max(ref_h, tgt_h), max(ref_w, tgt_w)), dtype=bool)
|
||||||
|
overlap_h = min(ref_h, tgt_h)
|
||||||
|
overlap_w = min(ref_w, tgt_w)
|
||||||
|
overlap_diff = np.any(ref_img[:overlap_h, :overlap_w] != target_img[:overlap_h, :overlap_w], axis=2)
|
||||||
|
diff_mask[:overlap_h, :overlap_w] = overlap_diff
|
||||||
|
different_pixels = int(np.count_nonzero(diff_mask))
|
||||||
|
return different_pixels, total_pixels
|
||||||
|
|
||||||
|
|
||||||
|
def compare_pdf_images(ref_pdf, target_pdf, dpi=150, threshold_percent=0.001):
|
||||||
|
"""Compare two PDFs by rasterizing them and counting differing pixels."""
|
||||||
|
ref_pages = render_pdf_to_images(ref_pdf, dpi=dpi)
|
||||||
|
target_pages = render_pdf_to_images(target_pdf, dpi=dpi)
|
||||||
|
|
||||||
|
total_pixels = 0
|
||||||
|
different_pixels = 0
|
||||||
|
max_pages = max(len(ref_pages), len(target_pages))
|
||||||
|
|
||||||
|
for page_idx in range(max_pages):
|
||||||
|
if page_idx < len(ref_pages) and page_idx < len(target_pages):
|
||||||
|
page_diff, page_total = compare_rendered_pages(ref_pages[page_idx], target_pages[page_idx])
|
||||||
|
else:
|
||||||
|
existing_page = ref_pages[page_idx] if page_idx < len(ref_pages) else target_pages[page_idx]
|
||||||
|
page_total = existing_page.shape[0] * existing_page.shape[1]
|
||||||
|
page_diff = page_total
|
||||||
|
|
||||||
|
total_pixels += page_total
|
||||||
|
different_pixels += page_diff
|
||||||
|
|
||||||
|
diff_percent = (different_pixels / total_pixels * 100.0) if total_pixels else 0.0
|
||||||
|
return {
|
||||||
|
"different_pixels": different_pixels,
|
||||||
|
"total_pixels": total_pixels,
|
||||||
|
"diff_percent": diff_percent,
|
||||||
|
"pages_ref": len(ref_pages),
|
||||||
|
"pages_target": len(target_pages),
|
||||||
|
"passed": diff_percent < threshold_percent
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
def compare_required_figures(reference_figure_dir, target_figure_dir):
|
||||||
|
"""Compare the required GW150914 figure PDFs."""
|
||||||
|
figure_names = [
|
||||||
|
"ADM_Constraint_Grid_Level_0.pdf",
|
||||||
|
"BH_Trajectory_21_XY.pdf",
|
||||||
|
"BH_Trajectory_XY.pdf"
|
||||||
|
]
|
||||||
|
|
||||||
|
results = []
|
||||||
|
for figure_name in figure_names:
|
||||||
|
ref_pdf = os.path.join(reference_figure_dir, figure_name)
|
||||||
|
target_pdf = os.path.join(target_figure_dir, figure_name)
|
||||||
|
|
||||||
|
if not os.path.exists(ref_pdf):
|
||||||
|
raise FileNotFoundError(f"Reference figure not found: {ref_pdf}")
|
||||||
|
if not os.path.exists(target_pdf):
|
||||||
|
raise FileNotFoundError(f"Target figure not found: {target_pdf}")
|
||||||
|
|
||||||
|
comparison = compare_pdf_images(ref_pdf, target_pdf)
|
||||||
|
comparison["name"] = figure_name
|
||||||
|
results.append(comparison)
|
||||||
|
|
||||||
|
return results
|
||||||
|
|
||||||
|
def calculate_all_rms_errors(bh_data_ref, bh_data_target):
|
||||||
def calculate_rms_error(bh_data_ref, bh_data_target):
|
|
||||||
"""
|
"""
|
||||||
Calculate trajectory-based RMS error on the XY plane between baseline and optimized simulations.
|
Calculate 3D Vector RMS and component-wise RMS (X, Y, Z) independently.
|
||||||
|
Uses r = sqrt(x^2 + y^2) as the denominator for all error normalizations.
|
||||||
This function computes the RMS error independently for BH1 and BH2 trajectories,
|
Returns the maximum error between BH1 and BH2 for each category.
|
||||||
then returns the maximum of the two as the final RMS error metric.
|
|
||||||
|
|
||||||
For each black hole, the RMS is calculated as:
|
|
||||||
RMS = sqrt( (1/M) * sum( (Δr_i / r_i^max)^2 ) ) × 100%
|
|
||||||
|
|
||||||
where:
|
|
||||||
Δr_i = sqrt((x_ref,i - x_new,i)^2 + (y_ref,i - y_new,i)^2)
|
|
||||||
r_i^max = max(sqrt(x_ref,i^2 + y_ref,i^2), sqrt(x_new,i^2 + y_new,i^2))
|
|
||||||
|
|
||||||
Args:
|
|
||||||
bh_data_ref: Reference (baseline) trajectory data
|
|
||||||
bh_data_target: Target (optimized) trajectory data
|
|
||||||
|
|
||||||
Returns:
|
|
||||||
rms_value: Final RMS error as a percentage (max of BH1 and BH2)
|
|
||||||
error: Error message if any
|
|
||||||
"""
|
"""
|
||||||
# Align data: truncate to the length of the shorter dataset
|
|
||||||
M = min(len(bh_data_ref['time']), len(bh_data_target['time']))
|
M = min(len(bh_data_ref['time']), len(bh_data_target['time']))
|
||||||
|
|
||||||
if M < 10:
|
if M < 10:
|
||||||
return None, "Insufficient data points for comparison"
|
return None, "Insufficient data points for comparison"
|
||||||
|
|
||||||
# Extract XY coordinates for both black holes
|
results = {}
|
||||||
x1_ref = bh_data_ref['x1'][:M]
|
|
||||||
y1_ref = bh_data_ref['y1'][:M]
|
|
||||||
x2_ref = bh_data_ref['x2'][:M]
|
|
||||||
y2_ref = bh_data_ref['y2'][:M]
|
|
||||||
|
|
||||||
x1_new = bh_data_target['x1'][:M]
|
for bh in ['1', '2']:
|
||||||
y1_new = bh_data_target['y1'][:M]
|
x_r, y_r, z_r = bh_data_ref[f'x{bh}'][:M], bh_data_ref[f'y{bh}'][:M], bh_data_ref[f'z{bh}'][:M]
|
||||||
x2_new = bh_data_target['x2'][:M]
|
x_n, y_n, z_n = bh_data_target[f'x{bh}'][:M], bh_data_target[f'y{bh}'][:M], bh_data_target[f'z{bh}'][:M]
|
||||||
y2_new = bh_data_target['y2'][:M]
|
|
||||||
|
|
||||||
# Calculate RMS for BH1
|
# 核心修改:根据组委会的邮件指示,分母统一使用 r = sqrt(x^2 + y^2)
|
||||||
delta_r1 = np.sqrt((x1_ref - x1_new)**2 + (y1_ref - y1_new)**2)
|
r_ref = np.sqrt(x_r**2 + y_r**2)
|
||||||
r1_ref = np.sqrt(x1_ref**2 + y1_ref**2)
|
r_new = np.sqrt(x_n**2 + y_n**2)
|
||||||
r1_new = np.sqrt(x1_new**2 + y1_new**2)
|
denom_max = np.maximum(r_ref, r_new)
|
||||||
r1_max = np.maximum(r1_ref, r1_new)
|
|
||||||
|
|
||||||
# Calculate RMS for BH2
|
valid = denom_max > 1e-15
|
||||||
delta_r2 = np.sqrt((x2_ref - x2_new)**2 + (y2_ref - y2_new)**2)
|
if np.sum(valid) < 10:
|
||||||
r2_ref = np.sqrt(x2_ref**2 + y2_ref**2)
|
results[f'BH{bh}'] = { '3D_Vector': 0.0, 'X_Component': 0.0, 'Y_Component': 0.0, 'Z_Component': 0.0 }
|
||||||
r2_new = np.sqrt(x2_new**2 + y2_new**2)
|
continue
|
||||||
r2_max = np.maximum(r2_ref, r2_new)
|
|
||||||
|
|
||||||
# Avoid division by zero for BH1
|
def calc_rms(delta):
|
||||||
valid_mask1 = r1_max > 1e-15
|
# 将对应分量的偏差除以统一的轨道半径分母 denom_max
|
||||||
if np.sum(valid_mask1) < 10:
|
return np.sqrt(np.mean((delta[valid] / denom_max[valid])**2)) * 100
|
||||||
return None, "Insufficient valid data points for BH1"
|
|
||||||
|
|
||||||
terms1 = (delta_r1[valid_mask1] / r1_max[valid_mask1])**2
|
# 1. Total 3D Vector RMS
|
||||||
rms_bh1 = np.sqrt(np.mean(terms1)) * 100
|
delta_vec = np.sqrt((x_r - x_n)**2 + (y_r - y_n)**2 + (z_r - z_n)**2)
|
||||||
|
rms_3d = calc_rms(delta_vec)
|
||||||
|
|
||||||
# Avoid division by zero for BH2
|
# 2. Component-wise RMS (分离计算各轴,但共用半径分母)
|
||||||
valid_mask2 = r2_max > 1e-15
|
rms_x = calc_rms(np.abs(x_r - x_n))
|
||||||
if np.sum(valid_mask2) < 10:
|
rms_y = calc_rms(np.abs(y_r - y_n))
|
||||||
return None, "Insufficient valid data points for BH2"
|
rms_z = calc_rms(np.abs(z_r - z_n))
|
||||||
|
|
||||||
terms2 = (delta_r2[valid_mask2] / r2_max[valid_mask2])**2
|
results[f'BH{bh}'] = {
|
||||||
rms_bh2 = np.sqrt(np.mean(terms2)) * 100
|
'3D_Vector': rms_3d,
|
||||||
|
'X_Component': rms_x,
|
||||||
|
'Y_Component': rms_y,
|
||||||
|
'Z_Component': rms_z
|
||||||
|
}
|
||||||
|
|
||||||
# Final RMS is the maximum of BH1 and BH2
|
# 获取 BH1 和 BH2 中的最大误差
|
||||||
rms_final = max(rms_bh1, rms_bh2)
|
max_rms = {
|
||||||
|
'3D_Vector': max(results['BH1']['3D_Vector'], results['BH2']['3D_Vector']),
|
||||||
return rms_final, None
|
'X_Component': max(results['BH1']['X_Component'], results['BH2']['X_Component']),
|
||||||
|
'Y_Component': max(results['BH1']['Y_Component'], results['BH2']['Y_Component']),
|
||||||
|
'Z_Component': max(results['BH1']['Z_Component'], results['BH2']['Z_Component'])
|
||||||
|
}
|
||||||
|
|
||||||
|
return max_rms, None
|
||||||
|
|
||||||
def analyze_constraint_violation(constraint_data, n_levels=9):
|
def analyze_constraint_violation(constraint_data, n_levels=9):
|
||||||
"""
|
"""
|
||||||
@@ -155,34 +277,32 @@ def analyze_constraint_violation(constraint_data, n_levels=9):
|
|||||||
|
|
||||||
|
|
||||||
def print_header():
|
def print_header():
|
||||||
"""Print report header"""
|
|
||||||
print("\n" + Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
print("\n" + Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
||||||
print(Color.BOLD + " AMSS-NCKU GW150914 Simulation Regression Test Report" + Color.RESET)
|
print(Color.BOLD + " AMSS-NCKU GW150914 Comprehensive Regression Test" + Color.RESET)
|
||||||
print(Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
print(Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
||||||
|
|
||||||
|
def print_rms_results(rms_dict, error, threshold=1.0):
|
||||||
def print_rms_results(rms_rel, error, threshold=1.0):
|
print(f"\n{Color.BOLD}1. RMS Error Analysis (Maximums of BH1 & BH2){Color.RESET}")
|
||||||
"""Print RMS error results"""
|
print("-" * 65)
|
||||||
print(f"\n{Color.BOLD}1. RMS Error Analysis (Baseline vs Optimized){Color.RESET}")
|
|
||||||
print("-" * 45)
|
|
||||||
|
|
||||||
if error:
|
if error:
|
||||||
print(f" {Color.RED}Error: {error}{Color.RESET}")
|
print(f" {Color.RED}Error: {error}{Color.RESET}")
|
||||||
return False
|
return False
|
||||||
|
|
||||||
passed = rms_rel < threshold
|
all_passed = True
|
||||||
|
print(f" Requirement: < {threshold}%\n")
|
||||||
|
|
||||||
print(f" RMS relative error: {rms_rel:.4f}%")
|
for key, val in rms_dict.items():
|
||||||
print(f" Requirement: < {threshold}%")
|
passed = val < threshold
|
||||||
print(f" Status: {get_status_text(passed)}")
|
all_passed = all_passed and passed
|
||||||
|
status = get_status_text(passed)
|
||||||
|
print(f" {key:15}: {val:8.4f}% | Status: {status}")
|
||||||
|
|
||||||
return passed
|
return all_passed
|
||||||
|
|
||||||
|
def print_constraint_results(results, threshold=2.0):
|
||||||
def print_constraint_results(results, threshold=2.0):
|
|
||||||
"""Print constraint violation results"""
|
|
||||||
print(f"\n{Color.BOLD}2. ADM Constraint Violation Analysis (Grid Level 0){Color.RESET}")
|
print(f"\n{Color.BOLD}2. ADM Constraint Violation Analysis (Grid Level 0){Color.RESET}")
|
||||||
print("-" * 45)
|
print("-" * 65)
|
||||||
|
|
||||||
names = ['Ham', 'Px', 'Py', 'Pz', 'Gx', 'Gy', 'Gz']
|
names = ['Ham', 'Px', 'Py', 'Pz', 'Gx', 'Gy', 'Gz']
|
||||||
for i, name in enumerate(names):
|
for i, name in enumerate(names):
|
||||||
@@ -195,23 +315,49 @@ def print_constraint_results(results, threshold=2.0):
|
|||||||
print(f"\n Maximum violation: {results['max_violation']:.6f}")
|
print(f"\n Maximum violation: {results['max_violation']:.6f}")
|
||||||
print(f" Requirement: < {threshold}")
|
print(f" Requirement: < {threshold}")
|
||||||
print(f" Status: {get_status_text(passed)}")
|
print(f" Status: {get_status_text(passed)}")
|
||||||
|
|
||||||
return passed
|
return passed
|
||||||
|
|
||||||
|
|
||||||
def print_summary(rms_passed, constraint_passed):
|
def print_figure_results(results, threshold_percent=0.001):
|
||||||
"""Print summary"""
|
print(f"\n{Color.BOLD}3. Figure Pixel Comparison (PDF Rasterization){Color.RESET}")
|
||||||
print("\n" + Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
print("-" * 65)
|
||||||
print(Color.BOLD + "Verification Summary" + Color.RESET)
|
print(f" Requirement: < {threshold_percent:.3f}% differing pixels\n")
|
||||||
print(Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
|
||||||
|
all_passed = True
|
||||||
all_passed = rms_passed and constraint_passed
|
for result in results:
|
||||||
|
passed = result["passed"]
|
||||||
res_rms = get_status_text(rms_passed)
|
all_passed = all_passed and passed
|
||||||
res_con = get_status_text(constraint_passed)
|
status = get_status_text(passed)
|
||||||
|
print(f" {result['name']:32}: {result['diff_percent']:10.6f}% | Status: {status}")
|
||||||
print(f" [1] RMS trajectory check: {res_rms}")
|
|
||||||
print(f" [2] ADM constraint check: {res_con}")
|
if result["pages_ref"] != result["pages_target"]:
|
||||||
|
print(f" {'':32} pages(ref/target): {result['pages_ref']}/{result['pages_target']}")
|
||||||
|
|
||||||
|
return all_passed
|
||||||
|
|
||||||
|
|
||||||
|
def print_figure_error(error_message):
|
||||||
|
print(f"\n{Color.BOLD}3. Figure Pixel Comparison (PDF Rasterization){Color.RESET}")
|
||||||
|
print("-" * 65)
|
||||||
|
print(f" {Color.RED}Error: {error_message}{Color.RESET}")
|
||||||
|
return False
|
||||||
|
|
||||||
|
|
||||||
|
def print_summary(rms_passed, constraint_passed, figure_passed):
|
||||||
|
print("\n" + Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
||||||
|
print(Color.BOLD + "Verification Summary" + Color.RESET)
|
||||||
|
print(Color.BLUE + Color.BOLD + "=" * 65 + Color.RESET)
|
||||||
|
|
||||||
|
all_passed = rms_passed and constraint_passed and figure_passed
|
||||||
|
|
||||||
|
res_rms = get_status_text(rms_passed)
|
||||||
|
res_con = get_status_text(constraint_passed)
|
||||||
|
res_fig = get_status_text(figure_passed)
|
||||||
|
|
||||||
|
print(f" [1] Comprehensive RMS check: {res_rms}")
|
||||||
|
print(f" [2] ADM constraint check: {res_con}")
|
||||||
|
print(f" [3] Figure pixel comparison: {res_fig}")
|
||||||
|
|
||||||
final_status = f"{Color.GREEN}{Color.BOLD}ALL CHECKS PASSED{Color.RESET}" if all_passed else f"{Color.RED}{Color.BOLD}SOME CHECKS FAILED{Color.RESET}"
|
final_status = f"{Color.GREEN}{Color.BOLD}ALL CHECKS PASSED{Color.RESET}" if all_passed else f"{Color.RED}{Color.BOLD}SOME CHECKS FAILED{Color.RESET}"
|
||||||
print(f"\n Overall result: {final_status}")
|
print(f"\n Overall result: {final_status}")
|
||||||
@@ -219,61 +365,58 @@ def print_summary(rms_passed, constraint_passed):
|
|||||||
|
|
||||||
return all_passed
|
return all_passed
|
||||||
|
|
||||||
|
|
||||||
def main():
|
def main():
|
||||||
# Determine target (optimized) output directory
|
|
||||||
if len(sys.argv) > 1:
|
if len(sys.argv) > 1:
|
||||||
target_dir = sys.argv[1]
|
target_dir = sys.argv[1]
|
||||||
else:
|
else:
|
||||||
script_dir = os.path.dirname(os.path.abspath(__file__))
|
script_dir = os.path.dirname(os.path.abspath(__file__))
|
||||||
target_dir = os.path.join(script_dir, "GW150914/AMSS_NCKU_output")
|
target_dir = os.path.join(script_dir, "GW150914/AMSS_NCKU_output")
|
||||||
|
|
||||||
# Determine reference (baseline) directory
|
script_dir = os.path.dirname(os.path.abspath(__file__))
|
||||||
script_dir = os.path.dirname(os.path.abspath(__file__))
|
reference_dir = os.path.join(script_dir, "GW150914-origin/AMSS_NCKU_output")
|
||||||
reference_dir = os.path.join(script_dir, "GW150914-origin/AMSS_NCKU_output")
|
target_figure_dir = resolve_figure_dir(target_dir)
|
||||||
|
reference_figure_dir = os.path.join(script_dir, "GW150914-origin/figure")
|
||||||
|
|
||||||
|
bh_file_ref = os.path.join(reference_dir, "bssn_BH.dat")
|
||||||
|
bh_file_target = os.path.join(target_dir, "bssn_BH.dat")
|
||||||
|
constraint_file = os.path.join(target_dir, "bssn_constraint.dat")
|
||||||
|
|
||||||
# Data file paths
|
|
||||||
bh_file_ref = os.path.join(reference_dir, "bssn_BH.dat")
|
|
||||||
bh_file_target = os.path.join(target_dir, "bssn_BH.dat")
|
|
||||||
constraint_file = os.path.join(target_dir, "bssn_constraint.dat")
|
|
||||||
|
|
||||||
# Check if files exist
|
|
||||||
if not os.path.exists(bh_file_ref):
|
if not os.path.exists(bh_file_ref):
|
||||||
print(f"{Color.RED}{Color.BOLD}Error:{Color.RESET} Baseline trajectory file not found: {bh_file_ref}")
|
print(f"{Color.RED}{Color.BOLD}Error:{Color.RESET} Baseline trajectory file not found: {bh_file_ref}")
|
||||||
sys.exit(1)
|
sys.exit(1)
|
||||||
|
|
||||||
if not os.path.exists(bh_file_target):
|
if not os.path.exists(bh_file_target):
|
||||||
print(f"{Color.RED}{Color.BOLD}Error:{Color.RESET} Target trajectory file not found: {bh_file_target}")
|
print(f"{Color.RED}{Color.BOLD}Error:{Color.RESET} Target trajectory file not found: {bh_file_target}")
|
||||||
sys.exit(1)
|
sys.exit(1)
|
||||||
|
|
||||||
if not os.path.exists(constraint_file):
|
if not os.path.exists(constraint_file):
|
||||||
print(f"{Color.RED}{Color.BOLD}Error:{Color.RESET} Constraint data file not found: {constraint_file}")
|
print(f"{Color.RED}{Color.BOLD}Error:{Color.RESET} Constraint data file not found: {constraint_file}")
|
||||||
sys.exit(1)
|
sys.exit(1)
|
||||||
|
|
||||||
# Print header
|
print_header()
|
||||||
print_header()
|
print(f"\n{Color.BOLD}Reference (Baseline):{Color.RESET} {Color.BLUE}{reference_dir}{Color.RESET}")
|
||||||
print(f"\n{Color.BOLD}Reference (Baseline):{Color.RESET} {Color.BLUE}{reference_dir}{Color.RESET}")
|
print(f"{Color.BOLD}Target (Optimized): {Color.RESET} {Color.BLUE}{target_dir}{Color.RESET}")
|
||||||
print(f"{Color.BOLD}Target (Optimized): {Color.RESET} {Color.BLUE}{target_dir}{Color.RESET}")
|
print(f"{Color.BOLD}Reference Figures: {Color.RESET} {Color.BLUE}{reference_figure_dir}{Color.RESET}")
|
||||||
|
print(f"{Color.BOLD}Target Figures: {Color.RESET} {Color.BLUE}{target_figure_dir}{Color.RESET}")
|
||||||
|
|
||||||
# Load data
|
|
||||||
bh_data_ref = load_bh_trajectory(bh_file_ref)
|
bh_data_ref = load_bh_trajectory(bh_file_ref)
|
||||||
bh_data_target = load_bh_trajectory(bh_file_target)
|
bh_data_target = load_bh_trajectory(bh_file_target)
|
||||||
constraint_data = load_constraint_data(constraint_file)
|
constraint_data = load_constraint_data(constraint_file)
|
||||||
|
|
||||||
# Calculate RMS error
|
# Output modified RMS results
|
||||||
rms_rel, error = calculate_rms_error(bh_data_ref, bh_data_target)
|
rms_dict, error = calculate_all_rms_errors(bh_data_ref, bh_data_target)
|
||||||
rms_passed = print_rms_results(rms_rel, error)
|
rms_passed = print_rms_results(rms_dict, error)
|
||||||
|
|
||||||
# Analyze constraint violation
|
|
||||||
constraint_results = analyze_constraint_violation(constraint_data)
|
|
||||||
constraint_passed = print_constraint_results(constraint_results)
|
|
||||||
|
|
||||||
# Print summary
|
|
||||||
all_passed = print_summary(rms_passed, constraint_passed)
|
|
||||||
|
|
||||||
# Return exit code
|
|
||||||
sys.exit(0 if all_passed else 1)
|
|
||||||
|
|
||||||
|
# Output constraint results
|
||||||
|
constraint_results = analyze_constraint_violation(constraint_data)
|
||||||
|
constraint_passed = print_constraint_results(constraint_results)
|
||||||
|
|
||||||
|
try:
|
||||||
|
figure_results = compare_required_figures(reference_figure_dir, target_figure_dir)
|
||||||
|
figure_passed = print_figure_results(figure_results)
|
||||||
|
except (FileNotFoundError, RuntimeError) as exc:
|
||||||
|
figure_passed = print_figure_error(str(exc))
|
||||||
|
|
||||||
|
all_passed = print_summary(rms_passed, constraint_passed, figure_passed)
|
||||||
|
sys.exit(0 if all_passed else 1)
|
||||||
|
|
||||||
if __name__ == "__main__":
|
if __name__ == "__main__":
|
||||||
main()
|
main()
|
||||||
|
|||||||
@@ -7,6 +7,7 @@
|
|||||||
#include <string>
|
#include <string>
|
||||||
#include <cmath>
|
#include <cmath>
|
||||||
#include <new>
|
#include <new>
|
||||||
|
#include <vector>
|
||||||
using namespace std;
|
using namespace std;
|
||||||
|
|
||||||
#include "misc.h"
|
#include "misc.h"
|
||||||
@@ -17,6 +18,168 @@ using namespace std;
|
|||||||
#include "interp_lb_profile.h"
|
#include "interp_lb_profile.h"
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
namespace
|
||||||
|
{
|
||||||
|
struct InterpBlockView
|
||||||
|
{
|
||||||
|
Block *bp;
|
||||||
|
double llb[dim];
|
||||||
|
double uub[dim];
|
||||||
|
};
|
||||||
|
|
||||||
|
struct BlockBinIndex
|
||||||
|
{
|
||||||
|
int bins[dim];
|
||||||
|
double lo[dim];
|
||||||
|
double inv[dim];
|
||||||
|
vector<InterpBlockView> views;
|
||||||
|
vector<vector<int>> bin_to_blocks;
|
||||||
|
bool valid;
|
||||||
|
|
||||||
|
BlockBinIndex() : valid(false)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < dim; i++)
|
||||||
|
{
|
||||||
|
bins[i] = 1;
|
||||||
|
lo[i] = 0.0;
|
||||||
|
inv[i] = 0.0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
inline int clamp_int(int v, int lo, int hi)
|
||||||
|
{
|
||||||
|
return (v < lo) ? lo : ((v > hi) ? hi : v);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline int coord_to_bin(double x, double lo, double inv, int nb)
|
||||||
|
{
|
||||||
|
if (nb <= 1 || inv <= 0.0)
|
||||||
|
return 0;
|
||||||
|
int b = int(floor((x - lo) * inv));
|
||||||
|
return clamp_int(b, 0, nb - 1);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline int bin_loc(const BlockBinIndex &index, int b0, int b1, int b2)
|
||||||
|
{
|
||||||
|
return b0 + index.bins[0] * (b1 + index.bins[1] * b2);
|
||||||
|
}
|
||||||
|
|
||||||
|
inline bool point_in_block_view(const InterpBlockView &view, const double *pox, const double *DH)
|
||||||
|
{
|
||||||
|
for (int i = 0; i < dim; i++)
|
||||||
|
{
|
||||||
|
if (pox[i] - view.llb[i] < -DH[i] / 2 || pox[i] - view.uub[i] > DH[i] / 2)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
|
||||||
|
void build_block_bin_index(Patch *patch, const double *DH, BlockBinIndex &index)
|
||||||
|
{
|
||||||
|
index = BlockBinIndex();
|
||||||
|
|
||||||
|
MyList<Block> *Bp = patch->blb;
|
||||||
|
while (Bp)
|
||||||
|
{
|
||||||
|
Block *BP = Bp->data;
|
||||||
|
InterpBlockView view;
|
||||||
|
view.bp = BP;
|
||||||
|
for (int i = 0; i < dim; i++)
|
||||||
|
{
|
||||||
|
#ifdef Vertex
|
||||||
|
#ifdef Cell
|
||||||
|
#error Both Cell and Vertex are defined
|
||||||
|
#endif
|
||||||
|
view.llb[i] = (feq(BP->bbox[i], patch->bbox[i], DH[i] / 2)) ? BP->bbox[i] + patch->lli[i] * DH[i] : BP->bbox[i] + (ghost_width - 0.5) * DH[i];
|
||||||
|
view.uub[i] = (feq(BP->bbox[dim + i], patch->bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - patch->uui[i] * DH[i] : BP->bbox[dim + i] - (ghost_width - 0.5) * DH[i];
|
||||||
|
#else
|
||||||
|
#ifdef Cell
|
||||||
|
view.llb[i] = (feq(BP->bbox[i], patch->bbox[i], DH[i] / 2)) ? BP->bbox[i] + patch->lli[i] * DH[i] : BP->bbox[i] + ghost_width * DH[i];
|
||||||
|
view.uub[i] = (feq(BP->bbox[dim + i], patch->bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - patch->uui[i] * DH[i] : BP->bbox[dim + i] - ghost_width * DH[i];
|
||||||
|
#else
|
||||||
|
#error Not define Vertex nor Cell
|
||||||
|
#endif
|
||||||
|
#endif
|
||||||
|
}
|
||||||
|
index.views.push_back(view);
|
||||||
|
if (Bp == patch->ble)
|
||||||
|
break;
|
||||||
|
Bp = Bp->next;
|
||||||
|
}
|
||||||
|
|
||||||
|
const int nblocks = int(index.views.size());
|
||||||
|
if (nblocks <= 0)
|
||||||
|
return;
|
||||||
|
|
||||||
|
int bins_1d = int(ceil(pow(double(nblocks), 1.0 / 3.0)));
|
||||||
|
bins_1d = clamp_int(bins_1d, 1, 32);
|
||||||
|
for (int i = 0; i < dim; i++)
|
||||||
|
{
|
||||||
|
index.bins[i] = bins_1d;
|
||||||
|
index.lo[i] = patch->bbox[i] + patch->lli[i] * DH[i];
|
||||||
|
const double hi = patch->bbox[dim + i] - patch->uui[i] * DH[i];
|
||||||
|
if (hi > index.lo[i] && bins_1d > 1)
|
||||||
|
index.inv[i] = bins_1d / (hi - index.lo[i]);
|
||||||
|
else
|
||||||
|
index.inv[i] = 0.0;
|
||||||
|
}
|
||||||
|
|
||||||
|
index.bin_to_blocks.resize(index.bins[0] * index.bins[1] * index.bins[2]);
|
||||||
|
|
||||||
|
for (int bi = 0; bi < nblocks; bi++)
|
||||||
|
{
|
||||||
|
const InterpBlockView &view = index.views[bi];
|
||||||
|
int bmin[dim], bmax[dim];
|
||||||
|
for (int d = 0; d < dim; d++)
|
||||||
|
{
|
||||||
|
const double low = view.llb[d] - DH[d] / 2;
|
||||||
|
const double up = view.uub[d] + DH[d] / 2;
|
||||||
|
bmin[d] = coord_to_bin(low, index.lo[d], index.inv[d], index.bins[d]);
|
||||||
|
bmax[d] = coord_to_bin(up, index.lo[d], index.inv[d], index.bins[d]);
|
||||||
|
if (bmax[d] < bmin[d])
|
||||||
|
{
|
||||||
|
int t = bmin[d];
|
||||||
|
bmin[d] = bmax[d];
|
||||||
|
bmax[d] = t;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int bz = bmin[2]; bz <= bmax[2]; bz++)
|
||||||
|
for (int by = bmin[1]; by <= bmax[1]; by++)
|
||||||
|
for (int bx = bmin[0]; bx <= bmax[0]; bx++)
|
||||||
|
index.bin_to_blocks[bin_loc(index, bx, by, bz)].push_back(bi);
|
||||||
|
}
|
||||||
|
|
||||||
|
index.valid = true;
|
||||||
|
}
|
||||||
|
|
||||||
|
int find_block_index_for_point(const BlockBinIndex &index, const double *pox, const double *DH)
|
||||||
|
{
|
||||||
|
if (!index.valid)
|
||||||
|
return -1;
|
||||||
|
|
||||||
|
const int bx = coord_to_bin(pox[0], index.lo[0], index.inv[0], index.bins[0]);
|
||||||
|
const int by = coord_to_bin(pox[1], index.lo[1], index.inv[1], index.bins[1]);
|
||||||
|
const int bz = coord_to_bin(pox[2], index.lo[2], index.inv[2], index.bins[2]);
|
||||||
|
const vector<int> &cand = index.bin_to_blocks[bin_loc(index, bx, by, bz)];
|
||||||
|
|
||||||
|
for (size_t ci = 0; ci < cand.size(); ci++)
|
||||||
|
{
|
||||||
|
const int bi = cand[ci];
|
||||||
|
if (point_in_block_view(index.views[bi], pox, DH))
|
||||||
|
return bi;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Fallback to full scan for numerical edge cases around bin boundaries.
|
||||||
|
for (size_t bi = 0; bi < index.views.size(); bi++)
|
||||||
|
if (point_in_block_view(index.views[bi], pox, DH))
|
||||||
|
return int(bi);
|
||||||
|
|
||||||
|
return -1;
|
||||||
|
}
|
||||||
|
} // namespace
|
||||||
|
|
||||||
Patch::Patch(int DIM, int *shapei, double *bboxi, int levi, bool buflog, int Symmetry) : lev(levi)
|
Patch::Patch(int DIM, int *shapei, double *bboxi, int levi, bool buflog, int Symmetry) : lev(levi)
|
||||||
{
|
{
|
||||||
|
|
||||||
@@ -367,9 +530,11 @@ void Patch::Interp_Points(MyList<var> *VarList,
|
|||||||
for (int j = 0; j < NN; j++)
|
for (int j = 0; j < NN; j++)
|
||||||
owner_rank[j] = -1;
|
owner_rank[j] = -1;
|
||||||
|
|
||||||
double DH[dim], llb[dim], uub[dim];
|
double DH[dim];
|
||||||
for (int i = 0; i < dim; i++)
|
for (int i = 0; i < dim; i++)
|
||||||
DH[i] = getdX(i);
|
DH[i] = getdX(i);
|
||||||
|
BlockBinIndex block_index;
|
||||||
|
build_block_bin_index(this, DH, block_index);
|
||||||
|
|
||||||
for (int j = 0; j < NN; j++) // run along points
|
for (int j = 0; j < NN; j++) // run along points
|
||||||
{
|
{
|
||||||
@@ -392,57 +557,24 @@ void Patch::Interp_Points(MyList<var> *VarList,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
MyList<Block> *Bp = blb;
|
const int block_i = find_block_index_for_point(block_index, pox, DH);
|
||||||
bool notfind = true;
|
if (block_i >= 0)
|
||||||
while (notfind && Bp) // run along Blocks
|
|
||||||
{
|
{
|
||||||
Block *BP = Bp->data;
|
Block *BP = block_index.views[block_i].bp;
|
||||||
|
owner_rank[j] = BP->rank;
|
||||||
bool flag = true;
|
if (myrank == BP->rank)
|
||||||
for (int i = 0; i < dim; i++)
|
|
||||||
{
|
{
|
||||||
#ifdef Vertex
|
//---> interpolation
|
||||||
#ifdef Cell
|
varl = VarList;
|
||||||
#error Both Cell and Vertex are defined
|
int k = 0;
|
||||||
#endif
|
while (varl) // run along variables
|
||||||
llb[i] = (feq(BP->bbox[i], bbox[i], DH[i] / 2)) ? BP->bbox[i] + lli[i] * DH[i] : BP->bbox[i] + (ghost_width - 0.5) * DH[i];
|
|
||||||
uub[i] = (feq(BP->bbox[dim + i], bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - uui[i] * DH[i] : BP->bbox[dim + i] - (ghost_width - 0.5) * DH[i];
|
|
||||||
#else
|
|
||||||
#ifdef Cell
|
|
||||||
llb[i] = (feq(BP->bbox[i], bbox[i], DH[i] / 2)) ? BP->bbox[i] + lli[i] * DH[i] : BP->bbox[i] + ghost_width * DH[i];
|
|
||||||
uub[i] = (feq(BP->bbox[dim + i], bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - uui[i] * DH[i] : BP->bbox[dim + i] - ghost_width * DH[i];
|
|
||||||
#else
|
|
||||||
#error Not define Vertex nor Cell
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
if (XX[i][j] - llb[i] < -DH[i] / 2 || XX[i][j] - uub[i] > DH[i] / 2)
|
|
||||||
{
|
{
|
||||||
flag = false;
|
f_global_interp(BP->shape, BP->X[0], BP->X[1], BP->X[2], BP->fgfs[varl->data->sgfn], Shellf[j * num_var + k],
|
||||||
break;
|
pox[0], pox[1], pox[2], ordn, varl->data->SoA, Symmetry);
|
||||||
|
varl = varl->next;
|
||||||
|
k++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (flag)
|
|
||||||
{
|
|
||||||
notfind = false;
|
|
||||||
owner_rank[j] = BP->rank;
|
|
||||||
if (myrank == BP->rank)
|
|
||||||
{
|
|
||||||
//---> interpolation
|
|
||||||
varl = VarList;
|
|
||||||
int k = 0;
|
|
||||||
while (varl) // run along variables
|
|
||||||
{
|
|
||||||
f_global_interp(BP->shape, BP->X[0], BP->X[1], BP->X[2], BP->fgfs[varl->data->sgfn], Shellf[j * num_var + k],
|
|
||||||
pox[0], pox[1], pox[2], ordn, varl->data->SoA, Symmetry);
|
|
||||||
varl = varl->next;
|
|
||||||
k++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (Bp == ble)
|
|
||||||
break;
|
|
||||||
Bp = Bp->next;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -535,9 +667,11 @@ void Patch::Interp_Points(MyList<var> *VarList,
|
|||||||
for (int j = 0; j < NN; j++)
|
for (int j = 0; j < NN; j++)
|
||||||
owner_rank[j] = -1;
|
owner_rank[j] = -1;
|
||||||
|
|
||||||
double DH[dim], llb[dim], uub[dim];
|
double DH[dim];
|
||||||
for (int i = 0; i < dim; i++)
|
for (int i = 0; i < dim; i++)
|
||||||
DH[i] = getdX(i);
|
DH[i] = getdX(i);
|
||||||
|
BlockBinIndex block_index;
|
||||||
|
build_block_bin_index(this, DH, block_index);
|
||||||
|
|
||||||
// --- Interpolation phase (identical to original) ---
|
// --- Interpolation phase (identical to original) ---
|
||||||
for (int j = 0; j < NN; j++)
|
for (int j = 0; j < NN; j++)
|
||||||
@@ -561,56 +695,23 @@ void Patch::Interp_Points(MyList<var> *VarList,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
MyList<Block> *Bp = blb;
|
const int block_i = find_block_index_for_point(block_index, pox, DH);
|
||||||
bool notfind = true;
|
if (block_i >= 0)
|
||||||
while (notfind && Bp)
|
|
||||||
{
|
{
|
||||||
Block *BP = Bp->data;
|
Block *BP = block_index.views[block_i].bp;
|
||||||
|
owner_rank[j] = BP->rank;
|
||||||
bool flag = true;
|
if (myrank == BP->rank)
|
||||||
for (int i = 0; i < dim; i++)
|
|
||||||
{
|
{
|
||||||
#ifdef Vertex
|
varl = VarList;
|
||||||
#ifdef Cell
|
int k = 0;
|
||||||
#error Both Cell and Vertex are defined
|
while (varl)
|
||||||
#endif
|
|
||||||
llb[i] = (feq(BP->bbox[i], bbox[i], DH[i] / 2)) ? BP->bbox[i] + lli[i] * DH[i] : BP->bbox[i] + (ghost_width - 0.5) * DH[i];
|
|
||||||
uub[i] = (feq(BP->bbox[dim + i], bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - uui[i] * DH[i] : BP->bbox[dim + i] - (ghost_width - 0.5) * DH[i];
|
|
||||||
#else
|
|
||||||
#ifdef Cell
|
|
||||||
llb[i] = (feq(BP->bbox[i], bbox[i], DH[i] / 2)) ? BP->bbox[i] + lli[i] * DH[i] : BP->bbox[i] + ghost_width * DH[i];
|
|
||||||
uub[i] = (feq(BP->bbox[dim + i], bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - uui[i] * DH[i] : BP->bbox[dim + i] - ghost_width * DH[i];
|
|
||||||
#else
|
|
||||||
#error Not define Vertex nor Cell
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
if (XX[i][j] - llb[i] < -DH[i] / 2 || XX[i][j] - uub[i] > DH[i] / 2)
|
|
||||||
{
|
{
|
||||||
flag = false;
|
f_global_interp(BP->shape, BP->X[0], BP->X[1], BP->X[2], BP->fgfs[varl->data->sgfn], Shellf[j * num_var + k],
|
||||||
break;
|
pox[0], pox[1], pox[2], ordn, varl->data->SoA, Symmetry);
|
||||||
|
varl = varl->next;
|
||||||
|
k++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (flag)
|
|
||||||
{
|
|
||||||
notfind = false;
|
|
||||||
owner_rank[j] = BP->rank;
|
|
||||||
if (myrank == BP->rank)
|
|
||||||
{
|
|
||||||
varl = VarList;
|
|
||||||
int k = 0;
|
|
||||||
while (varl)
|
|
||||||
{
|
|
||||||
f_global_interp(BP->shape, BP->X[0], BP->X[1], BP->X[2], BP->fgfs[varl->data->sgfn], Shellf[j * num_var + k],
|
|
||||||
pox[0], pox[1], pox[2], ordn, varl->data->SoA, Symmetry);
|
|
||||||
varl = varl->next;
|
|
||||||
k++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (Bp == ble)
|
|
||||||
break;
|
|
||||||
Bp = Bp->next;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -833,9 +934,11 @@ void Patch::Interp_Points(MyList<var> *VarList,
|
|||||||
MPI_Comm_group(MPI_COMM_WORLD, &world_group);
|
MPI_Comm_group(MPI_COMM_WORLD, &world_group);
|
||||||
MPI_Comm_group(Comm_here, &local_group);
|
MPI_Comm_group(Comm_here, &local_group);
|
||||||
|
|
||||||
double DH[dim], llb[dim], uub[dim];
|
double DH[dim];
|
||||||
for (int i = 0; i < dim; i++)
|
for (int i = 0; i < dim; i++)
|
||||||
DH[i] = getdX(i);
|
DH[i] = getdX(i);
|
||||||
|
BlockBinIndex block_index;
|
||||||
|
build_block_bin_index(this, DH, block_index);
|
||||||
|
|
||||||
for (int j = 0; j < NN; j++) // run along points
|
for (int j = 0; j < NN; j++) // run along points
|
||||||
{
|
{
|
||||||
@@ -858,57 +961,24 @@ void Patch::Interp_Points(MyList<var> *VarList,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
MyList<Block> *Bp = blb;
|
const int block_i = find_block_index_for_point(block_index, pox, DH);
|
||||||
bool notfind = true;
|
if (block_i >= 0)
|
||||||
while (notfind && Bp) // run along Blocks
|
|
||||||
{
|
{
|
||||||
Block *BP = Bp->data;
|
Block *BP = block_index.views[block_i].bp;
|
||||||
|
owner_rank[j] = BP->rank;
|
||||||
bool flag = true;
|
if (myrank == BP->rank)
|
||||||
for (int i = 0; i < dim; i++)
|
|
||||||
{
|
{
|
||||||
#ifdef Vertex
|
//---> interpolation
|
||||||
#ifdef Cell
|
varl = VarList;
|
||||||
#error Both Cell and Vertex are defined
|
int k = 0;
|
||||||
#endif
|
while (varl) // run along variables
|
||||||
llb[i] = (feq(BP->bbox[i], bbox[i], DH[i] / 2)) ? BP->bbox[i] + lli[i] * DH[i] : BP->bbox[i] + (ghost_width - 0.5) * DH[i];
|
|
||||||
uub[i] = (feq(BP->bbox[dim + i], bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - uui[i] * DH[i] : BP->bbox[dim + i] - (ghost_width - 0.5) * DH[i];
|
|
||||||
#else
|
|
||||||
#ifdef Cell
|
|
||||||
llb[i] = (feq(BP->bbox[i], bbox[i], DH[i] / 2)) ? BP->bbox[i] + lli[i] * DH[i] : BP->bbox[i] + ghost_width * DH[i];
|
|
||||||
uub[i] = (feq(BP->bbox[dim + i], bbox[dim + i], DH[i] / 2)) ? BP->bbox[dim + i] - uui[i] * DH[i] : BP->bbox[dim + i] - ghost_width * DH[i];
|
|
||||||
#else
|
|
||||||
#error Not define Vertex nor Cell
|
|
||||||
#endif
|
|
||||||
#endif
|
|
||||||
if (XX[i][j] - llb[i] < -DH[i] / 2 || XX[i][j] - uub[i] > DH[i] / 2)
|
|
||||||
{
|
{
|
||||||
flag = false;
|
f_global_interp(BP->shape, BP->X[0], BP->X[1], BP->X[2], BP->fgfs[varl->data->sgfn], Shellf[j * num_var + k],
|
||||||
break;
|
pox[0], pox[1], pox[2], ordn, varl->data->SoA, Symmetry);
|
||||||
|
varl = varl->next;
|
||||||
|
k++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (flag)
|
|
||||||
{
|
|
||||||
notfind = false;
|
|
||||||
owner_rank[j] = BP->rank;
|
|
||||||
if (myrank == BP->rank)
|
|
||||||
{
|
|
||||||
//---> interpolation
|
|
||||||
varl = VarList;
|
|
||||||
int k = 0;
|
|
||||||
while (varl) // run along variables
|
|
||||||
{
|
|
||||||
f_global_interp(BP->shape, BP->X[0], BP->X[1], BP->X[2], BP->fgfs[varl->data->sgfn], Shellf[j * num_var + k],
|
|
||||||
pox[0], pox[1], pox[2], ordn, varl->data->SoA, Symmetry);
|
|
||||||
varl = varl->next;
|
|
||||||
k++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (Bp == ble)
|
|
||||||
break;
|
|
||||||
Bp = Bp->next;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
@@ -108,6 +108,9 @@ namespace Parallel
|
|||||||
MPI_Status *stats;
|
MPI_Status *stats;
|
||||||
int max_reqs;
|
int max_reqs;
|
||||||
bool lengths_valid;
|
bool lengths_valid;
|
||||||
|
int *tc_req_node;
|
||||||
|
int *tc_req_is_recv;
|
||||||
|
int *tc_completed;
|
||||||
SyncCache();
|
SyncCache();
|
||||||
void invalidate();
|
void invalidate();
|
||||||
void destroy();
|
void destroy();
|
||||||
@@ -121,7 +124,10 @@ namespace Parallel
|
|||||||
struct AsyncSyncState {
|
struct AsyncSyncState {
|
||||||
int req_no;
|
int req_no;
|
||||||
bool active;
|
bool active;
|
||||||
AsyncSyncState() : req_no(0), active(false) {}
|
int *req_node;
|
||||||
|
int *req_is_recv;
|
||||||
|
int pending_recv;
|
||||||
|
AsyncSyncState() : req_no(0), active(false), req_node(0), req_is_recv(0), pending_recv(0) {}
|
||||||
};
|
};
|
||||||
|
|
||||||
void Sync_start(MyList<Patch> *PatL, MyList<var> *VarList, int Symmetry,
|
void Sync_start(MyList<Patch> *PatL, MyList<var> *VarList, int Symmetry,
|
||||||
@@ -173,12 +179,13 @@ namespace Parallel
|
|||||||
MyList<Parallel::gridseg> *clone_gsl(MyList<Parallel::gridseg> *p, bool first_only);
|
MyList<Parallel::gridseg> *clone_gsl(MyList<Parallel::gridseg> *p, bool first_only);
|
||||||
MyList<Parallel::gridseg> *build_bulk_gsl(Patch *Pat); // similar to build_owned_gsl0 but does not care rank issue
|
MyList<Parallel::gridseg> *build_bulk_gsl(Patch *Pat); // similar to build_owned_gsl0 but does not care rank issue
|
||||||
MyList<Parallel::gridseg> *build_bulk_gsl(Block *bp, Patch *Pat);
|
MyList<Parallel::gridseg> *build_bulk_gsl(Block *bp, Patch *Pat);
|
||||||
void build_PhysBD_gstl(Patch *Pat, MyList<Parallel::gridseg> *srci, MyList<Parallel::gridseg> *dsti,
|
void build_PhysBD_gstl(Patch *Pat, MyList<Parallel::gridseg> *srci, MyList<Parallel::gridseg> *dsti,
|
||||||
MyList<Parallel::gridseg> **out_src, MyList<Parallel::gridseg> **out_dst);
|
MyList<Parallel::gridseg> **out_src, MyList<Parallel::gridseg> **out_dst);
|
||||||
void PeriodicBD(Patch *Pat, MyList<var> *VarList, int Symmetry);
|
void PeriodicBD(Patch *Pat, MyList<var> *VarList, int Symmetry);
|
||||||
double L2Norm(Patch *Pat, var *vf);
|
double L2Norm(Patch *Pat, var *vf);
|
||||||
void checkgsl(MyList<Parallel::gridseg> *pp, bool first_only);
|
void L2Norm7(Patch *Pat, var **vf, double *norms);
|
||||||
void checkvarl(MyList<var> *pp, bool first_only);
|
void checkgsl(MyList<Parallel::gridseg> *pp, bool first_only);
|
||||||
|
void checkvarl(MyList<var> *pp, bool first_only);
|
||||||
MyList<Parallel::gridseg> *divide_gsl(MyList<Parallel::gridseg> *p, Patch *Pat);
|
MyList<Parallel::gridseg> *divide_gsl(MyList<Parallel::gridseg> *p, Patch *Pat);
|
||||||
MyList<Parallel::gridseg> *divide_gs(MyList<Parallel::gridseg> *p, Patch *Pat);
|
MyList<Parallel::gridseg> *divide_gs(MyList<Parallel::gridseg> *p, Patch *Pat);
|
||||||
void prepare_inter_time_level(Patch *Pat,
|
void prepare_inter_time_level(Patch *Pat,
|
||||||
@@ -210,11 +217,12 @@ namespace Parallel
|
|||||||
void aligncheck(double *bbox0, double *bboxl, int lev, double *DH0, int *shape);
|
void aligncheck(double *bbox0, double *bboxl, int lev, double *DH0, int *shape);
|
||||||
bool point_locat_gsl(double *pox, MyList<Parallel::gridseg> *gsl);
|
bool point_locat_gsl(double *pox, MyList<Parallel::gridseg> *gsl);
|
||||||
void checkpatchlist(MyList<Patch> *PatL, bool buflog);
|
void checkpatchlist(MyList<Patch> *PatL, bool buflog);
|
||||||
|
|
||||||
double L2Norm(Patch *Pat, var *vf, MPI_Comm Comm_here);
|
double L2Norm(Patch *Pat, var *vf, MPI_Comm Comm_here);
|
||||||
bool PatList_Interp_Points(MyList<Patch> *PatL, MyList<var> *VarList,
|
void L2Norm7(Patch *Pat, var **vf, double *norms, MPI_Comm Comm_here);
|
||||||
int NN, double **XX,
|
bool PatList_Interp_Points(MyList<Patch> *PatL, MyList<var> *VarList,
|
||||||
double *Shellf, int Symmetry, MPI_Comm Comm_here);
|
int NN, double **XX,
|
||||||
|
double *Shellf, int Symmetry, MPI_Comm Comm_here);
|
||||||
#if (PSTR == 1 || PSTR == 2 || PSTR == 3)
|
#if (PSTR == 1 || PSTR == 2 || PSTR == 3)
|
||||||
MyList<Block> *distribute(MyList<Patch> *PatchLIST, int cpusize, int ingfsi, int fngfsi,
|
MyList<Block> *distribute(MyList<Patch> *PatchLIST, int cpusize, int ingfsi, int fngfsi,
|
||||||
bool periodic, int start_rank, int end_rank, int nodes = 0);
|
bool periodic, int start_rank, int end_rank, int nodes = 0);
|
||||||
|
|||||||
@@ -3439,10 +3439,10 @@ void ShellPatch::write_Pablo_file_ss(int *ext, double xmin, double xmax, double
|
|||||||
delete[] Z;
|
delete[] Z;
|
||||||
}
|
}
|
||||||
|
|
||||||
double ShellPatch::L2Norm(var *vf)
|
double ShellPatch::L2Norm(var *vf)
|
||||||
{
|
{
|
||||||
double tvf, dtvf = 0;
|
double tvf, dtvf = 0;
|
||||||
int BDW = overghost;
|
int BDW = overghost;
|
||||||
|
|
||||||
MyList<ss_patch> *sPp = PatL;
|
MyList<ss_patch> *sPp = PatL;
|
||||||
while (sPp)
|
while (sPp)
|
||||||
@@ -3469,13 +3469,50 @@ double ShellPatch::L2Norm(var *vf)
|
|||||||
MPI_Allreduce(&dtvf, &tvf, 1, MPI_DOUBLE, MPI_SUM, MPI_COMM_WORLD);
|
MPI_Allreduce(&dtvf, &tvf, 1, MPI_DOUBLE, MPI_SUM, MPI_COMM_WORLD);
|
||||||
|
|
||||||
tvf = sqrt(tvf);
|
tvf = sqrt(tvf);
|
||||||
|
|
||||||
return tvf;
|
return tvf;
|
||||||
}
|
}
|
||||||
|
void ShellPatch::L2Norm7(var **vf, double *norms)
|
||||||
// find maximum of abstract value, XX store position for maximum, Shellf store maximum themselvs
|
{
|
||||||
void ShellPatch::Find_Maximum(MyList<var> *VarList, double *XX,
|
double tvf[7], dtvf[7];
|
||||||
double *Shellf)
|
int BDW = overghost;
|
||||||
|
for (int i = 0; i < 7; i++)
|
||||||
|
dtvf[i] = 0;
|
||||||
|
|
||||||
|
MyList<ss_patch> *sPp = PatL;
|
||||||
|
while (sPp)
|
||||||
|
{
|
||||||
|
MyList<Block> *Bp = sPp->data->blb;
|
||||||
|
while (Bp)
|
||||||
|
{
|
||||||
|
Block *cg = Bp->data;
|
||||||
|
if (myrank == cg->rank)
|
||||||
|
{
|
||||||
|
f_l2normhelper7(cg->shape, cg->X[0], cg->X[1], cg->X[2],
|
||||||
|
sPp->data->bbox[0], sPp->data->bbox[1], sPp->data->bbox[2],
|
||||||
|
sPp->data->bbox[3], sPp->data->bbox[4], sPp->data->bbox[5],
|
||||||
|
cg->fgfs[vf[0]->sgfn], cg->fgfs[vf[1]->sgfn], cg->fgfs[vf[2]->sgfn],
|
||||||
|
cg->fgfs[vf[3]->sgfn], cg->fgfs[vf[4]->sgfn], cg->fgfs[vf[5]->sgfn],
|
||||||
|
cg->fgfs[vf[6]->sgfn], tvf, BDW);
|
||||||
|
for (int i = 0; i < 7; i++)
|
||||||
|
dtvf[i] += tvf[i];
|
||||||
|
}
|
||||||
|
if (Bp == sPp->data->ble)
|
||||||
|
break;
|
||||||
|
Bp = Bp->next;
|
||||||
|
}
|
||||||
|
sPp = sPp->next;
|
||||||
|
}
|
||||||
|
|
||||||
|
MPI_Allreduce(dtvf, tvf, 7, MPI_DOUBLE, MPI_SUM, MPI_COMM_WORLD);
|
||||||
|
|
||||||
|
for (int i = 0; i < 7; i++)
|
||||||
|
norms[i] = sqrt(tvf[i]);
|
||||||
|
}
|
||||||
|
|
||||||
|
// find maximum of abstract value, XX store position for maximum, Shellf store maximum themselvs
|
||||||
|
void ShellPatch::Find_Maximum(MyList<var> *VarList, double *XX,
|
||||||
|
double *Shellf)
|
||||||
{
|
{
|
||||||
MyList<var> *varl;
|
MyList<var> *varl;
|
||||||
int num_var = 0;
|
int num_var = 0;
|
||||||
|
|||||||
@@ -195,10 +195,11 @@ public:
|
|||||||
bool Interp_One_Point(MyList<var> *VarList,
|
bool Interp_One_Point(MyList<var> *VarList,
|
||||||
double *XX, /*input global Cartesian coordinate*/
|
double *XX, /*input global Cartesian coordinate*/
|
||||||
double *Shellf, int Symmetry);
|
double *Shellf, int Symmetry);
|
||||||
void write_Pablo_file_ss(int *ext, double xmin, double xmax, double ymin, double ymax, double zmin, double zmax,
|
void write_Pablo_file_ss(int *ext, double xmin, double xmax, double ymin, double ymax, double zmin, double zmax,
|
||||||
char *filename, int sst);
|
char *filename, int sst);
|
||||||
double L2Norm(var *vf);
|
double L2Norm(var *vf);
|
||||||
void Find_Maximum(MyList<var> *VarList, double *XX, double *Shellf);
|
void L2Norm7(var **vf, double *norms);
|
||||||
};
|
void Find_Maximum(MyList<var> *VarList, double *XX, double *Shellf);
|
||||||
|
};
|
||||||
|
|
||||||
#endif /* SHELLPATCH_H */
|
#endif /* SHELLPATCH_H */
|
||||||
|
|||||||
@@ -27,7 +27,7 @@ using namespace std;
|
|||||||
#endif
|
#endif
|
||||||
|
|
||||||
#include "TwoPunctures.h"
|
#include "TwoPunctures.h"
|
||||||
#include <mkl_cblas.h>
|
#include <cblas.h>
|
||||||
|
|
||||||
TwoPunctures::TwoPunctures(double mp, double mm, double b,
|
TwoPunctures::TwoPunctures(double mp, double mm, double b,
|
||||||
double P_plusx, double P_plusy, double P_plusz,
|
double P_plusx, double P_plusy, double P_plusz,
|
||||||
|
|||||||
@@ -258,6 +258,8 @@ void bssnEM_class::Initialize()
|
|||||||
PhysTime = StartTime;
|
PhysTime = StartTime;
|
||||||
Setup_Black_Hole_position();
|
Setup_Black_Hole_position();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
setup_transfer_caches();
|
||||||
}
|
}
|
||||||
|
|
||||||
//================================================================================================
|
//================================================================================================
|
||||||
|
|||||||
@@ -23,8 +23,14 @@ using namespace std;
|
|||||||
#include "rungekutta4_rout.h"
|
#include "rungekutta4_rout.h"
|
||||||
#include "sommerfeld_rout.h"
|
#include "sommerfeld_rout.h"
|
||||||
#include "getnp4.h"
|
#include "getnp4.h"
|
||||||
#include "shellfunctions.h"
|
#include "shellfunctions.h"
|
||||||
#include "parameters.h"
|
#include "parameters.h"
|
||||||
|
|
||||||
|
#if BSSN_USE_ESCALAR_C_KERNEL
|
||||||
|
#define BSSN_ESCALAR_RHS f_compute_rhs_bssn_escalar_c
|
||||||
|
#else
|
||||||
|
#define BSSN_ESCALAR_RHS f_compute_rhs_bssn_escalar
|
||||||
|
#endif
|
||||||
|
|
||||||
#ifdef With_AHF
|
#ifdef With_AHF
|
||||||
#include "derivatives.h"
|
#include "derivatives.h"
|
||||||
@@ -74,8 +80,8 @@ bssnEScalar_class::bssnEScalar_class(double Couranti, double StartTimei, double
|
|||||||
|
|
||||||
//================================================================================================
|
//================================================================================================
|
||||||
|
|
||||||
void bssnEScalar_class::Initialize()
|
void bssnEScalar_class::Initialize()
|
||||||
{
|
{
|
||||||
Sphio = new var("Sphio", ngfs++, 1, 1, 1);
|
Sphio = new var("Sphio", ngfs++, 1, 1, 1);
|
||||||
Spio = new var("Spio", ngfs++, 1, 1, 1);
|
Spio = new var("Spio", ngfs++, 1, 1, 1);
|
||||||
Sphi0 = new var("Sphi0", ngfs++, 1, 1, 1);
|
Sphi0 = new var("Sphi0", ngfs++, 1, 1, 1);
|
||||||
@@ -132,11 +138,14 @@ void bssnEScalar_class::Initialize()
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
GH = new cgh(0, ngfs, Symmetry, pname, checkrun, ErrorMonitor);
|
GH = new cgh(0, ngfs, Symmetry, pname, checkrun, ErrorMonitor);
|
||||||
if (checkrun)
|
ConstraintRefreshLevels = new int[GH->levels];
|
||||||
CheckPoint->readcheck_cgh(PhysTime, GH, myrank, nprocs, Symmetry);
|
for (int il = 0; il < GH->levels; il++)
|
||||||
else
|
ConstraintRefreshLevels[il] = 0;
|
||||||
GH->compose_cgh(nprocs);
|
if (checkrun)
|
||||||
|
CheckPoint->readcheck_cgh(PhysTime, GH, myrank, nprocs, Symmetry);
|
||||||
|
else
|
||||||
|
GH->compose_cgh(nprocs);
|
||||||
|
|
||||||
#ifdef WithShell
|
#ifdef WithShell
|
||||||
SH = new ShellPatch(0, ngfs, pname, Symmetry, myrank, ErrorMonitor);
|
SH = new ShellPatch(0, ngfs, pname, Symmetry, myrank, ErrorMonitor);
|
||||||
@@ -160,12 +169,14 @@ void bssnEScalar_class::Initialize()
|
|||||||
{
|
{
|
||||||
CheckPoint->read_Black_Hole_position(BH_num_input, BH_num, Porg0, Pmom, Spin, Mass, Porgbr, Porg, Porg1, Porg_rhs);
|
CheckPoint->read_Black_Hole_position(BH_num_input, BH_num, Porg0, Pmom, Spin, Mass, Porgbr, Porg, Porg1, Porg_rhs);
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
PhysTime = StartTime;
|
PhysTime = StartTime;
|
||||||
Setup_Black_Hole_position();
|
Setup_Black_Hole_position();
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
setup_transfer_caches();
|
||||||
|
}
|
||||||
|
|
||||||
//================================================================================================
|
//================================================================================================
|
||||||
|
|
||||||
@@ -207,10 +218,10 @@ bssnEScalar_class::~bssnEScalar_class()
|
|||||||
|
|
||||||
// Read initial data solved by Ansorg, PRD 70, 064011 (2004)
|
// Read initial data solved by Ansorg, PRD 70, 064011 (2004)
|
||||||
|
|
||||||
void bssnEScalar_class::Read_Ansorg()
|
void bssnEScalar_class::Read_Ansorg()
|
||||||
{
|
{
|
||||||
if (!checkrun)
|
if (!checkrun)
|
||||||
{
|
{
|
||||||
if (myrank == 0)
|
if (myrank == 0)
|
||||||
cout << "Read initial data from Ansorg's solver,"
|
cout << "Read initial data from Ansorg's solver,"
|
||||||
<< " please be sure the input parameters for black holes are puncture parameters!!"
|
<< " please be sure the input parameters for black holes are puncture parameters!!"
|
||||||
@@ -227,9 +238,12 @@ void bssnEScalar_class::Read_Ansorg()
|
|||||||
cout << "Error inputpar" << endl;
|
cout << "Error inputpar" << endl;
|
||||||
exit(0);
|
exit(0);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
int BH_NM;
|
int BH_NM;
|
||||||
double *Porg_here;
|
double *Porg_here;
|
||||||
|
double *pmom_local;
|
||||||
|
double *spin_local;
|
||||||
|
double *mass_local;
|
||||||
// read parameter from file
|
// read parameter from file
|
||||||
{
|
{
|
||||||
const int LEN = 256;
|
const int LEN = 256;
|
||||||
@@ -269,11 +283,11 @@ void bssnEScalar_class::Read_Ansorg()
|
|||||||
}
|
}
|
||||||
inf.close();
|
inf.close();
|
||||||
}
|
}
|
||||||
|
|
||||||
Porg_here = new double[3 * BH_NM];
|
Porg_here = new double[3 * BH_NM];
|
||||||
Pmom = new double[3 * BH_NM];
|
pmom_local = new double[3 * BH_NM];
|
||||||
Spin = new double[3 * BH_NM];
|
spin_local = new double[3 * BH_NM];
|
||||||
Mass = new double[BH_NM];
|
mass_local = new double[BH_NM];
|
||||||
// read parameter from file
|
// read parameter from file
|
||||||
{
|
{
|
||||||
const int LEN = 256;
|
const int LEN = 256;
|
||||||
@@ -305,37 +319,37 @@ void bssnEScalar_class::Read_Ansorg()
|
|||||||
else if (status == 0)
|
else if (status == 0)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (sgrp == "BSSN" && sind < BH_NM)
|
if (sgrp == "BSSN" && sind < BH_NM)
|
||||||
{
|
{
|
||||||
if (skey == "Mass")
|
if (skey == "Mass")
|
||||||
Mass[sind] = atof(sval.c_str());
|
mass_local[sind] = atof(sval.c_str());
|
||||||
else if (skey == "Porgx")
|
else if (skey == "Porgx")
|
||||||
Porg_here[sind * 3] = atof(sval.c_str());
|
Porg_here[sind * 3] = atof(sval.c_str());
|
||||||
else if (skey == "Porgy")
|
else if (skey == "Porgy")
|
||||||
Porg_here[sind * 3 + 1] = atof(sval.c_str());
|
Porg_here[sind * 3 + 1] = atof(sval.c_str());
|
||||||
else if (skey == "Porgz")
|
else if (skey == "Porgz")
|
||||||
Porg_here[sind * 3 + 2] = atof(sval.c_str());
|
Porg_here[sind * 3 + 2] = atof(sval.c_str());
|
||||||
else if (skey == "Spinx")
|
else if (skey == "Spinx")
|
||||||
Spin[sind * 3] = atof(sval.c_str());
|
spin_local[sind * 3] = atof(sval.c_str());
|
||||||
else if (skey == "Spiny")
|
else if (skey == "Spiny")
|
||||||
Spin[sind * 3 + 1] = atof(sval.c_str());
|
spin_local[sind * 3 + 1] = atof(sval.c_str());
|
||||||
else if (skey == "Spinz")
|
else if (skey == "Spinz")
|
||||||
Spin[sind * 3 + 2] = atof(sval.c_str());
|
spin_local[sind * 3 + 2] = atof(sval.c_str());
|
||||||
else if (skey == "Pmomx")
|
else if (skey == "Pmomx")
|
||||||
Pmom[sind * 3] = atof(sval.c_str());
|
pmom_local[sind * 3] = atof(sval.c_str());
|
||||||
else if (skey == "Pmomy")
|
else if (skey == "Pmomy")
|
||||||
Pmom[sind * 3 + 1] = atof(sval.c_str());
|
pmom_local[sind * 3 + 1] = atof(sval.c_str());
|
||||||
else if (skey == "Pmomz")
|
else if (skey == "Pmomz")
|
||||||
Pmom[sind * 3 + 2] = atof(sval.c_str());
|
pmom_local[sind * 3 + 2] = atof(sval.c_str());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
inf.close();
|
inf.close();
|
||||||
}
|
}
|
||||||
int order = 6;
|
int order = 6;
|
||||||
Ansorg read_ansorg("Ansorg.psid", order);
|
Ansorg read_ansorg("Ansorg.psid", order);
|
||||||
// set initial data
|
// set initial data
|
||||||
for (int lev = 0; lev < GH->levels; lev++)
|
for (int lev = 0; lev < GH->levels; lev++)
|
||||||
{
|
{
|
||||||
MyList<Patch> *Pp = GH->PatL[lev];
|
MyList<Patch> *Pp = GH->PatL[lev];
|
||||||
while (Pp)
|
while (Pp)
|
||||||
{
|
{
|
||||||
@@ -358,21 +372,21 @@ void bssnEScalar_class::Read_Ansorg()
|
|||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
cg->fgfs[Lap0->sgfn],
|
cg->fgfs[Lap0->sgfn],
|
||||||
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
||||||
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
||||||
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
||||||
Mass, Porg_here, Pmom, Spin, BH_NM);
|
mass_local, Porg_here, pmom_local, spin_local, BH_NM);
|
||||||
}
|
}
|
||||||
if (BL == Pp->data->ble)
|
if (BL == Pp->data->ble)
|
||||||
break;
|
break;
|
||||||
BL = BL->next;
|
BL = BL->next;
|
||||||
}
|
}
|
||||||
Pp = Pp->next;
|
Pp = Pp->next;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#ifdef WithShell
|
#ifdef WithShell
|
||||||
// ShellPatch part
|
// ShellPatch part
|
||||||
MyList<ss_patch> *Pp = SH->PatL;
|
MyList<ss_patch> *Pp = SH->PatL;
|
||||||
while (Pp)
|
while (Pp)
|
||||||
{
|
{
|
||||||
@@ -400,25 +414,28 @@ void bssnEScalar_class::Read_Ansorg()
|
|||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
cg->fgfs[Lap0->sgfn],
|
cg->fgfs[Lap0->sgfn],
|
||||||
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
||||||
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
||||||
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
||||||
Mass, Porg_here, Pmom, Spin, BH_NM);
|
mass_local, Porg_here, pmom_local, spin_local, BH_NM);
|
||||||
}
|
}
|
||||||
if (BL == Pp->data->ble)
|
if (BL == Pp->data->ble)
|
||||||
break;
|
break;
|
||||||
BL = BL->next;
|
BL = BL->next;
|
||||||
}
|
}
|
||||||
Pp = Pp->next;
|
Pp = Pp->next;
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
delete[] Porg_here;
|
delete[] Porg_here;
|
||||||
// dump read_in initial data
|
delete[] pmom_local;
|
||||||
// for(int lev=0;lev<GH->levels;lev++) Parallel::Dump_Data(GH->PatL[lev],StateList,0,PhysTime,dT);
|
delete[] spin_local;
|
||||||
}
|
delete[] mass_local;
|
||||||
}
|
// dump read_in initial data
|
||||||
|
// for(int lev=0;lev<GH->levels;lev++) Parallel::Dump_Data(GH->PatL[lev],StateList,0,PhysTime,dT);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
//================================================================================================
|
//================================================================================================
|
||||||
|
|
||||||
@@ -432,10 +449,10 @@ void bssnEScalar_class::Read_Ansorg()
|
|||||||
|
|
||||||
// Read initial data solved by Pablo's Olliptic Phys.Rev.D 82 024005 (2010)
|
// Read initial data solved by Pablo's Olliptic Phys.Rev.D 82 024005 (2010)
|
||||||
|
|
||||||
void bssnEScalar_class::Read_Pablo()
|
void bssnEScalar_class::Read_Pablo()
|
||||||
{
|
{
|
||||||
if (!checkrun)
|
if (!checkrun)
|
||||||
{
|
{
|
||||||
if (myrank == 0)
|
if (myrank == 0)
|
||||||
cout << "Read initial data from Pablo's solver,"
|
cout << "Read initial data from Pablo's solver,"
|
||||||
<< " please be sure the input parameters for black holes are puncture parameters!!"
|
<< " please be sure the input parameters for black holes are puncture parameters!!"
|
||||||
@@ -452,9 +469,12 @@ void bssnEScalar_class::Read_Pablo()
|
|||||||
cout << "Error inputpar" << endl;
|
cout << "Error inputpar" << endl;
|
||||||
exit(0);
|
exit(0);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
int BH_NM;
|
int BH_NM;
|
||||||
double *Porg_here;
|
double *Porg_here;
|
||||||
|
double *pmom_local;
|
||||||
|
double *spin_local;
|
||||||
|
double *mass_local;
|
||||||
// read parameter from file
|
// read parameter from file
|
||||||
{
|
{
|
||||||
const int LEN = 256;
|
const int LEN = 256;
|
||||||
@@ -494,11 +514,11 @@ void bssnEScalar_class::Read_Pablo()
|
|||||||
}
|
}
|
||||||
inf.close();
|
inf.close();
|
||||||
}
|
}
|
||||||
|
|
||||||
Porg_here = new double[3 * BH_NM];
|
Porg_here = new double[3 * BH_NM];
|
||||||
Pmom = new double[3 * BH_NM];
|
pmom_local = new double[3 * BH_NM];
|
||||||
Spin = new double[3 * BH_NM];
|
spin_local = new double[3 * BH_NM];
|
||||||
Mass = new double[BH_NM];
|
mass_local = new double[BH_NM];
|
||||||
// read parameter from file
|
// read parameter from file
|
||||||
{
|
{
|
||||||
const int LEN = 256;
|
const int LEN = 256;
|
||||||
@@ -530,31 +550,31 @@ void bssnEScalar_class::Read_Pablo()
|
|||||||
else if (status == 0)
|
else if (status == 0)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (sgrp == "BSSN" && sind < BH_NM)
|
if (sgrp == "BSSN" && sind < BH_NM)
|
||||||
{
|
{
|
||||||
if (skey == "Mass")
|
if (skey == "Mass")
|
||||||
Mass[sind] = atof(sval.c_str());
|
mass_local[sind] = atof(sval.c_str());
|
||||||
else if (skey == "Porgx")
|
else if (skey == "Porgx")
|
||||||
Porg_here[sind * 3] = atof(sval.c_str());
|
Porg_here[sind * 3] = atof(sval.c_str());
|
||||||
else if (skey == "Porgy")
|
else if (skey == "Porgy")
|
||||||
Porg_here[sind * 3 + 1] = atof(sval.c_str());
|
Porg_here[sind * 3 + 1] = atof(sval.c_str());
|
||||||
else if (skey == "Porgz")
|
else if (skey == "Porgz")
|
||||||
Porg_here[sind * 3 + 2] = atof(sval.c_str());
|
Porg_here[sind * 3 + 2] = atof(sval.c_str());
|
||||||
else if (skey == "Spinx")
|
else if (skey == "Spinx")
|
||||||
Spin[sind * 3] = atof(sval.c_str());
|
spin_local[sind * 3] = atof(sval.c_str());
|
||||||
else if (skey == "Spiny")
|
else if (skey == "Spiny")
|
||||||
Spin[sind * 3 + 1] = atof(sval.c_str());
|
spin_local[sind * 3 + 1] = atof(sval.c_str());
|
||||||
else if (skey == "Spinz")
|
else if (skey == "Spinz")
|
||||||
Spin[sind * 3 + 2] = atof(sval.c_str());
|
spin_local[sind * 3 + 2] = atof(sval.c_str());
|
||||||
else if (skey == "Pmomx")
|
else if (skey == "Pmomx")
|
||||||
Pmom[sind * 3] = atof(sval.c_str());
|
pmom_local[sind * 3] = atof(sval.c_str());
|
||||||
else if (skey == "Pmomy")
|
else if (skey == "Pmomy")
|
||||||
Pmom[sind * 3 + 1] = atof(sval.c_str());
|
pmom_local[sind * 3 + 1] = atof(sval.c_str());
|
||||||
else if (skey == "Pmomz")
|
else if (skey == "Pmomz")
|
||||||
Pmom[sind * 3 + 2] = atof(sval.c_str());
|
pmom_local[sind * 3 + 2] = atof(sval.c_str());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
inf.close();
|
inf.close();
|
||||||
}
|
}
|
||||||
bool flag = false;
|
bool flag = false;
|
||||||
int DIM = dim;
|
int DIM = dim;
|
||||||
@@ -594,11 +614,11 @@ void bssnEScalar_class::Read_Pablo()
|
|||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
cg->fgfs[Lap0->sgfn],
|
cg->fgfs[Lap0->sgfn],
|
||||||
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
||||||
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
||||||
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
||||||
Mass, Porg_here, Pmom, Spin, BH_NM);
|
mass_local, Porg_here, pmom_local, spin_local, BH_NM);
|
||||||
}
|
}
|
||||||
if (BL == Pp->data->ble)
|
if (BL == Pp->data->ble)
|
||||||
break;
|
break;
|
||||||
@@ -658,11 +678,11 @@ void bssnEScalar_class::Read_Pablo()
|
|||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
cg->fgfs[Lap0->sgfn],
|
cg->fgfs[Lap0->sgfn],
|
||||||
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
cg->fgfs[Sfx0->sgfn], cg->fgfs[Sfy0->sgfn], cg->fgfs[Sfz0->sgfn],
|
||||||
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
cg->fgfs[dtSfx0->sgfn], cg->fgfs[dtSfy0->sgfn], cg->fgfs[dtSfz0->sgfn],
|
||||||
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
cg->fgfs[Sphi0->sgfn], cg->fgfs[Spi0->sgfn],
|
||||||
Mass, Porg_here, Pmom, Spin, BH_NM);
|
mass_local, Porg_here, pmom_local, spin_local, BH_NM);
|
||||||
}
|
}
|
||||||
if (BL == Pp->data->ble)
|
if (BL == Pp->data->ble)
|
||||||
break;
|
break;
|
||||||
@@ -684,10 +704,13 @@ void bssnEScalar_class::Read_Pablo()
|
|||||||
Pp = Pp->next;
|
Pp = Pp->next;
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
delete[] Porg_here;
|
delete[] Porg_here;
|
||||||
if (flag && myrank == 0)
|
delete[] pmom_local;
|
||||||
MPI_Abort(MPI_COMM_WORLD, 1);
|
delete[] spin_local;
|
||||||
|
delete[] mass_local;
|
||||||
|
if (flag && myrank == 0)
|
||||||
|
MPI_Abort(MPI_COMM_WORLD, 1);
|
||||||
// dump read_in initial data
|
// dump read_in initial data
|
||||||
for (int lev = 0; lev < GH->levels; lev++)
|
for (int lev = 0; lev < GH->levels; lev++)
|
||||||
Parallel::Dump_Data(GH->PatL[lev], StateList, 0, PhysTime, dT);
|
Parallel::Dump_Data(GH->PatL[lev], StateList, 0, PhysTime, dT);
|
||||||
@@ -739,10 +762,10 @@ void bssnEScalar_class::Step(int lev, int YN)
|
|||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn]);
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn]);
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
if (f_compute_rhs_bssn_escalar(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
if (BSSN_ESCALAR_RHS(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
||||||
cg->fgfs[phi0->sgfn], cg->fgfs[trK0->sgfn],
|
cg->fgfs[phi0->sgfn], cg->fgfs[trK0->sgfn],
|
||||||
cg->fgfs[gxx0->sgfn], cg->fgfs[gxy0->sgfn], cg->fgfs[gxz0->sgfn],
|
cg->fgfs[gxx0->sgfn], cg->fgfs[gxy0->sgfn], cg->fgfs[gxz0->sgfn],
|
||||||
cg->fgfs[gyy0->sgfn], cg->fgfs[gyz0->sgfn], cg->fgfs[gzz0->sgfn],
|
cg->fgfs[gyy0->sgfn], cg->fgfs[gyz0->sgfn], cg->fgfs[gzz0->sgfn],
|
||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
@@ -993,11 +1016,12 @@ void bssnEScalar_class::Step(int lev, int YN)
|
|||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
Parallel::Sync(GH->PatL[lev], SynchList_pre, Symmetry);
|
Parallel::AsyncSyncState async_pre;
|
||||||
|
sync_predictor_start(lev, SynchList_pre, async_pre);
|
||||||
|
|
||||||
#ifdef WithShell
|
#ifdef WithShell
|
||||||
if (lev == 0)
|
if (lev == 0)
|
||||||
{
|
{
|
||||||
clock_t prev_clock, curr_clock;
|
clock_t prev_clock, curr_clock;
|
||||||
if (myrank == 0)
|
if (myrank == 0)
|
||||||
curr_clock = clock();
|
curr_clock = clock();
|
||||||
@@ -1009,9 +1033,10 @@ void bssnEScalar_class::Step(int lev, int YN)
|
|||||||
cout << " Shell stuff synchronization used "
|
cout << " Shell stuff synchronization used "
|
||||||
<< (double)(curr_clock - prev_clock) / ((double)CLOCKS_PER_SEC)
|
<< (double)(curr_clock - prev_clock) / ((double)CLOCKS_PER_SEC)
|
||||||
<< " seconds! " << endl;
|
<< " seconds! " << endl;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
sync_predictor_finish(lev, async_pre, SynchList_pre);
|
||||||
|
|
||||||
// for black hole position
|
// for black hole position
|
||||||
if (BH_num > 0 && lev == GH->levels - 1)
|
if (BH_num > 0 && lev == GH->levels - 1)
|
||||||
@@ -1081,10 +1106,10 @@ void bssnEScalar_class::Step(int lev, int YN)
|
|||||||
cg->fgfs[Ayy->sgfn], cg->fgfs[Ayz->sgfn], cg->fgfs[Azz->sgfn]);
|
cg->fgfs[Ayy->sgfn], cg->fgfs[Ayz->sgfn], cg->fgfs[Azz->sgfn]);
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
if (f_compute_rhs_bssn_escalar(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
if (BSSN_ESCALAR_RHS(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
||||||
cg->fgfs[phi->sgfn], cg->fgfs[trK->sgfn],
|
cg->fgfs[phi->sgfn], cg->fgfs[trK->sgfn],
|
||||||
cg->fgfs[gxx->sgfn], cg->fgfs[gxy->sgfn], cg->fgfs[gxz->sgfn],
|
cg->fgfs[gxx->sgfn], cg->fgfs[gxy->sgfn], cg->fgfs[gxz->sgfn],
|
||||||
cg->fgfs[gyy->sgfn], cg->fgfs[gyz->sgfn], cg->fgfs[gzz->sgfn],
|
cg->fgfs[gyy->sgfn], cg->fgfs[gyz->sgfn], cg->fgfs[gzz->sgfn],
|
||||||
cg->fgfs[Axx->sgfn], cg->fgfs[Axy->sgfn], cg->fgfs[Axz->sgfn],
|
cg->fgfs[Axx->sgfn], cg->fgfs[Axy->sgfn], cg->fgfs[Axz->sgfn],
|
||||||
cg->fgfs[Ayy->sgfn], cg->fgfs[Ayz->sgfn], cg->fgfs[Azz->sgfn],
|
cg->fgfs[Ayy->sgfn], cg->fgfs[Ayz->sgfn], cg->fgfs[Azz->sgfn],
|
||||||
cg->fgfs[Gmx->sgfn], cg->fgfs[Gmy->sgfn], cg->fgfs[Gmz->sgfn],
|
cg->fgfs[Gmx->sgfn], cg->fgfs[Gmy->sgfn], cg->fgfs[Gmz->sgfn],
|
||||||
@@ -1349,11 +1374,12 @@ void bssnEScalar_class::Step(int lev, int YN)
|
|||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
Parallel::Sync(GH->PatL[lev], SynchList_cor, Symmetry);
|
Parallel::AsyncSyncState async_cor;
|
||||||
|
sync_corrector_start(lev, SynchList_cor, async_cor);
|
||||||
|
|
||||||
#ifdef WithShell
|
#ifdef WithShell
|
||||||
if (lev == 0)
|
if (lev == 0)
|
||||||
{
|
{
|
||||||
clock_t prev_clock, curr_clock;
|
clock_t prev_clock, curr_clock;
|
||||||
if (myrank == 0)
|
if (myrank == 0)
|
||||||
curr_clock = clock();
|
curr_clock = clock();
|
||||||
@@ -1365,9 +1391,10 @@ void bssnEScalar_class::Step(int lev, int YN)
|
|||||||
cout << " Shell stuff synchronization used "
|
cout << " Shell stuff synchronization used "
|
||||||
<< (double)(curr_clock - prev_clock) / ((double)CLOCKS_PER_SEC)
|
<< (double)(curr_clock - prev_clock) / ((double)CLOCKS_PER_SEC)
|
||||||
<< " seconds! " << endl;
|
<< " seconds! " << endl;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
sync_corrector_finish(lev, async_cor, SynchList_cor);
|
||||||
// for black hole position
|
// for black hole position
|
||||||
if (BH_num > 0 && lev == GH->levels - 1)
|
if (BH_num > 0 && lev == GH->levels - 1)
|
||||||
{
|
{
|
||||||
@@ -1835,11 +1862,14 @@ void bssnEScalar_class::AnalysisStuff_EScalar(int lev, double dT_lev)
|
|||||||
|
|
||||||
//================================================================================================
|
//================================================================================================
|
||||||
|
|
||||||
void bssnEScalar_class::Interp_Constraint()
|
void bssnEScalar_class::Interp_Constraint(bool infg)
|
||||||
{
|
{
|
||||||
// we do not support a_lev != 0 yet.
|
if (!infg)
|
||||||
if (a_lev > 0)
|
return;
|
||||||
return;
|
|
||||||
|
// we do not support a_lev != 0 yet.
|
||||||
|
if (a_lev > 0)
|
||||||
|
return;
|
||||||
|
|
||||||
for (int lev = 0; lev < GH->levels; lev++)
|
for (int lev = 0; lev < GH->levels; lev++)
|
||||||
{
|
{
|
||||||
@@ -1858,10 +1888,10 @@ void bssnEScalar_class::Interp_Constraint()
|
|||||||
if (myrank == cg->rank)
|
if (myrank == cg->rank)
|
||||||
{
|
{
|
||||||
if (lev > 0)
|
if (lev > 0)
|
||||||
f_compute_rhs_bssn_escalar(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
BSSN_ESCALAR_RHS(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
||||||
cg->fgfs[phi0->sgfn], cg->fgfs[trK0->sgfn],
|
cg->fgfs[phi0->sgfn], cg->fgfs[trK0->sgfn],
|
||||||
cg->fgfs[gxx0->sgfn], cg->fgfs[gxy0->sgfn], cg->fgfs[gxz0->sgfn],
|
cg->fgfs[gxx0->sgfn], cg->fgfs[gxy0->sgfn], cg->fgfs[gxz0->sgfn],
|
||||||
cg->fgfs[gyy0->sgfn], cg->fgfs[gyz0->sgfn], cg->fgfs[gzz0->sgfn],
|
cg->fgfs[gyy0->sgfn], cg->fgfs[gyz0->sgfn], cg->fgfs[gzz0->sgfn],
|
||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
@@ -2078,10 +2108,10 @@ void bssnEScalar_class::Constraint_Out()
|
|||||||
if (myrank == cg->rank)
|
if (myrank == cg->rank)
|
||||||
{
|
{
|
||||||
if (lev > 0)
|
if (lev > 0)
|
||||||
f_compute_rhs_bssn_escalar(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
BSSN_ESCALAR_RHS(cg->shape, TRK4, cg->X[0], cg->X[1], cg->X[2],
|
||||||
cg->fgfs[phi0->sgfn], cg->fgfs[trK0->sgfn],
|
cg->fgfs[phi0->sgfn], cg->fgfs[trK0->sgfn],
|
||||||
cg->fgfs[gxx0->sgfn], cg->fgfs[gxy0->sgfn], cg->fgfs[gxz0->sgfn],
|
cg->fgfs[gxx0->sgfn], cg->fgfs[gxy0->sgfn], cg->fgfs[gxz0->sgfn],
|
||||||
cg->fgfs[gyy0->sgfn], cg->fgfs[gyz0->sgfn], cg->fgfs[gzz0->sgfn],
|
cg->fgfs[gyy0->sgfn], cg->fgfs[gyz0->sgfn], cg->fgfs[gzz0->sgfn],
|
||||||
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
cg->fgfs[Axx0->sgfn], cg->fgfs[Axy0->sgfn], cg->fgfs[Axz0->sgfn],
|
||||||
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
cg->fgfs[Ayy0->sgfn], cg->fgfs[Ayz0->sgfn], cg->fgfs[Azz0->sgfn],
|
||||||
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
cg->fgfs[Gmx0->sgfn], cg->fgfs[Gmy0->sgfn], cg->fgfs[Gmz0->sgfn],
|
||||||
|
|||||||
@@ -51,7 +51,7 @@ public:
|
|||||||
void Compute_Psi4(int lev);
|
void Compute_Psi4(int lev);
|
||||||
void Step(int lev, int YN);
|
void Step(int lev, int YN);
|
||||||
void AnalysisStuff_EScalar(int lev, double dT_lev);
|
void AnalysisStuff_EScalar(int lev, double dT_lev);
|
||||||
void Interp_Constraint();
|
void Interp_Constraint(bool infg);
|
||||||
void Constraint_Out();
|
void Constraint_Out();
|
||||||
|
|
||||||
protected:
|
protected:
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
@@ -31,11 +31,19 @@ using namespace std;
|
|||||||
#include "surface_integral.h"
|
#include "surface_integral.h"
|
||||||
#include "checkpoint.h"
|
#include "checkpoint.h"
|
||||||
|
|
||||||
extern void setpbh(int iBHN, double **iPBH, double *iMass, int rBHN);
|
extern void setpbh(int iBHN, double **iPBH, double *iMass, int rBHN);
|
||||||
|
|
||||||
class bssn_class
|
#ifndef BSSN_USE_TRANSFER_CACHE
|
||||||
{
|
#define BSSN_USE_TRANSFER_CACHE 1
|
||||||
public:
|
#endif
|
||||||
|
|
||||||
|
#ifndef BSSN_USE_ESCALAR_C_KERNEL
|
||||||
|
#define BSSN_USE_ESCALAR_C_KERNEL 1
|
||||||
|
#endif
|
||||||
|
|
||||||
|
class bssn_class
|
||||||
|
{
|
||||||
|
public:
|
||||||
int ngfs;
|
int ngfs;
|
||||||
int nprocs, myrank;
|
int nprocs, myrank;
|
||||||
cgh *GH;
|
cgh *GH;
|
||||||
@@ -45,10 +53,11 @@ public:
|
|||||||
int checkrun;
|
int checkrun;
|
||||||
char checkfilename[50];
|
char checkfilename[50];
|
||||||
int Steps;
|
int Steps;
|
||||||
double StartTime, TotalTime;
|
double StartTime, TotalTime;
|
||||||
double AnasTime, DumpTime, d2DumpTime, CheckTime;
|
double AnasTime, DumpTime, d2DumpTime, CheckTime;
|
||||||
double LastAnas, LastConsOut;
|
double LastAnas, LastConsOut;
|
||||||
double Courant;
|
int *ConstraintRefreshLevels;
|
||||||
|
double Courant;
|
||||||
double numepss, numepsb, numepsh;
|
double numepss, numepsb, numepsh;
|
||||||
int Symmetry;
|
int Symmetry;
|
||||||
int maxl, decn;
|
int maxl, decn;
|
||||||
@@ -130,10 +139,12 @@ public:
|
|||||||
Parallel::SyncCache *sync_cache_cor; // per-level cache for corrector sync
|
Parallel::SyncCache *sync_cache_cor; // per-level cache for corrector sync
|
||||||
Parallel::SyncCache *sync_cache_rp_coarse; // RestrictProlong sync on PatL[lev-1]
|
Parallel::SyncCache *sync_cache_rp_coarse; // RestrictProlong sync on PatL[lev-1]
|
||||||
Parallel::SyncCache *sync_cache_rp_fine; // RestrictProlong sync on PatL[lev]
|
Parallel::SyncCache *sync_cache_rp_fine; // RestrictProlong sync on PatL[lev]
|
||||||
|
Parallel::SyncCache *sync_cache_restrict; // cached Restrict in RestrictProlong
|
||||||
|
Parallel::SyncCache *sync_cache_outbd; // cached OutBdLow2Hi in RestrictProlong
|
||||||
|
|
||||||
monitor *ErrorMonitor, *Psi4Monitor, *BHMonitor, *MAPMonitor;
|
monitor *ErrorMonitor, *Psi4Monitor, *BHMonitor, *MAPMonitor;
|
||||||
monitor *ConVMonitor;
|
monitor *ConVMonitor, *TimingMonitor;
|
||||||
surface_integral *Waveshell;
|
surface_integral *Waveshell;
|
||||||
checkpoint *CheckPoint;
|
checkpoint *CheckPoint;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
@@ -164,14 +175,25 @@ public:
|
|||||||
void Setup_KerrSchild();
|
void Setup_KerrSchild();
|
||||||
void Enforce_algcon(int lev, int fg);
|
void Enforce_algcon(int lev, int fg);
|
||||||
|
|
||||||
void testRestrict();
|
void testRestrict();
|
||||||
void testOutBd();
|
void testOutBd();
|
||||||
|
|
||||||
bool check_Stdin_Abort();
|
bool check_Stdin_Abort();
|
||||||
|
bool use_transfer_cache() const;
|
||||||
virtual void Setup_Initial_Data_Cao();
|
void setup_transfer_caches();
|
||||||
virtual void Setup_Initial_Data_Lousto();
|
void invalidate_transfer_caches();
|
||||||
virtual void Initialize();
|
void destroy_transfer_caches();
|
||||||
|
void sync_predictor_start(int lev, MyList<var> *VarList, Parallel::AsyncSyncState &async_state);
|
||||||
|
void sync_predictor_finish(int lev, Parallel::AsyncSyncState &async_state, MyList<var> *VarList);
|
||||||
|
void sync_corrector_start(int lev, MyList<var> *VarList, Parallel::AsyncSyncState &async_state);
|
||||||
|
void sync_corrector_finish(int lev, Parallel::AsyncSyncState &async_state, MyList<var> *VarList);
|
||||||
|
void sync_evolution(int lev, MyList<var> *VarList, Parallel::SyncCache *cache_array = 0);
|
||||||
|
void restrict_evolution(int lev, MyList<var> *src_var_list, MyList<var> *dst_var_list);
|
||||||
|
void outbdlow2hi_evolution(int lev, MyList<var> *src_var_list, MyList<var> *dst_var_list);
|
||||||
|
|
||||||
|
virtual void Setup_Initial_Data_Cao();
|
||||||
|
virtual void Setup_Initial_Data_Lousto();
|
||||||
|
virtual void Initialize();
|
||||||
virtual void Read_Ansorg();
|
virtual void Read_Ansorg();
|
||||||
virtual void Read_Pablo() {};
|
virtual void Read_Pablo() {};
|
||||||
virtual void Compute_Psi4(int lev);
|
virtual void Compute_Psi4(int lev);
|
||||||
|
|||||||
169
AMSS_NCKU_source/bssn_escalar_rhs_c.C
Normal file
169
AMSS_NCKU_source/bssn_escalar_rhs_c.C
Normal file
@@ -0,0 +1,169 @@
|
|||||||
|
#include "macrodef.h"
|
||||||
|
#include "bssn_rhs.h"
|
||||||
|
#include "share_func.h"
|
||||||
|
#include "tool.h"
|
||||||
|
#include <vector>
|
||||||
|
|
||||||
|
namespace
|
||||||
|
{
|
||||||
|
// Reuse the temporary workspace across block calls to avoid repeated heap churn
|
||||||
|
// in the EScalar wrapper. MPI ranks execute this path sequentially, so a single
|
||||||
|
// process-local buffer is sufficient here.
|
||||||
|
std::vector<double> g_escalar_tmp_store;
|
||||||
|
}
|
||||||
|
|
||||||
|
#ifdef fortran1
|
||||||
|
#define f_frpotential frpotential
|
||||||
|
#endif
|
||||||
|
#ifdef fortran2
|
||||||
|
#define f_frpotential FRPOTENTIAL
|
||||||
|
#endif
|
||||||
|
#ifdef fortran3
|
||||||
|
#define f_frpotential frpotential_
|
||||||
|
#endif
|
||||||
|
|
||||||
|
extern "C"
|
||||||
|
{
|
||||||
|
void f_frpotential(int *, double *, double *, double *);
|
||||||
|
}
|
||||||
|
|
||||||
|
int f_compute_rhs_bssn_escalar_c(int *ex, double &T,
|
||||||
|
double *X, double *Y, double *Z,
|
||||||
|
double *chi, double *trK,
|
||||||
|
double *dxx, double *gxy, double *gxz, double *dyy, double *gyz, double *dzz,
|
||||||
|
double *Axx, double *Axy, double *Axz, double *Ayy, double *Ayz, double *Azz,
|
||||||
|
double *Gamx, double *Gamy, double *Gamz,
|
||||||
|
double *Lap, double *betax, double *betay, double *betaz,
|
||||||
|
double *dtSfx, double *dtSfy, double *dtSfz,
|
||||||
|
double *Sphi, double *Spi,
|
||||||
|
double *chi_rhs, double *trK_rhs,
|
||||||
|
double *gxx_rhs, double *gxy_rhs, double *gxz_rhs, double *gyy_rhs, double *gyz_rhs, double *gzz_rhs,
|
||||||
|
double *Axx_rhs, double *Axy_rhs, double *Axz_rhs, double *Ayy_rhs, double *Ayz_rhs, double *Azz_rhs,
|
||||||
|
double *Gamx_rhs, double *Gamy_rhs, double *Gamz_rhs,
|
||||||
|
double *Lap_rhs, double *betax_rhs, double *betay_rhs, double *betaz_rhs,
|
||||||
|
double *dtSfx_rhs, double *dtSfy_rhs, double *dtSfz_rhs,
|
||||||
|
double *Sphi_rhs, double *Spi_rhs,
|
||||||
|
double *rho, double *Sx, double *Sy, double *Sz,
|
||||||
|
double *Sxx, double *Sxy, double *Sxz, double *Syy, double *Syz, double *Szz,
|
||||||
|
double *Gamxxx, double *Gamxxy, double *Gamxxz, double *Gamxyy, double *Gamxyz, double *Gamxzz,
|
||||||
|
double *Gamyxx, double *Gamyxy, double *Gamyxz, double *Gamyyy, double *Gamyyz, double *Gamyzz,
|
||||||
|
double *Gamzxx, double *Gamzxy, double *Gamzxz, double *Gamzyy, double *Gamzyz, double *Gamzzz,
|
||||||
|
double *Rxx, double *Rxy, double *Rxz, double *Ryy, double *Ryz, double *Rzz,
|
||||||
|
double *ham_Res, double *movx_Res, double *movy_Res, double *movz_Res,
|
||||||
|
double *Gmx_Res, double *Gmy_Res, double *Gmz_Res,
|
||||||
|
int &Symmetry, int &Lev, double &eps, int &co)
|
||||||
|
{
|
||||||
|
const int nx = ex[0], ny = ex[1], nz = ex[2];
|
||||||
|
const int all = nx * ny * nz;
|
||||||
|
|
||||||
|
const size_t workspace_size = size_t(all) * 17;
|
||||||
|
if (g_escalar_tmp_store.size() < workspace_size)
|
||||||
|
g_escalar_tmp_store.resize(workspace_size);
|
||||||
|
|
||||||
|
double *tmp_ptr = g_escalar_tmp_store.data();
|
||||||
|
auto alloc_tmp = [&](int n = 1) -> double *
|
||||||
|
{
|
||||||
|
double *ptr = tmp_ptr;
|
||||||
|
tmp_ptr += size_t(all) * n;
|
||||||
|
return ptr;
|
||||||
|
};
|
||||||
|
|
||||||
|
double *chix = alloc_tmp(), *chiy = alloc_tmp(), *chiz = alloc_tmp();
|
||||||
|
double *Kx = alloc_tmp(), *Ky = alloc_tmp(), *Kz = alloc_tmp();
|
||||||
|
double *fxx = alloc_tmp(), *fxy = alloc_tmp(), *fxz = alloc_tmp();
|
||||||
|
double *fyy = alloc_tmp(), *fyz = alloc_tmp(), *fzz = alloc_tmp();
|
||||||
|
double *Lapx = alloc_tmp(), *Lapy = alloc_tmp(), *Lapz = alloc_tmp();
|
||||||
|
double *V = alloc_tmp(), *dVdSphi = alloc_tmp();
|
||||||
|
|
||||||
|
const double ZEO = 0.0, ONE = 1.0, TWO = 2.0, HALF = 0.5;
|
||||||
|
const double SSS[3] = {1.0, 1.0, 1.0};
|
||||||
|
|
||||||
|
fderivs(ex, chi, chix, chiy, chiz, X, Y, Z, 1.0, 1.0, 1.0, Symmetry, Lev);
|
||||||
|
fderivs(ex, Lap, Lapx, Lapy, Lapz, X, Y, Z, 1.0, 1.0, 1.0, Symmetry, Lev);
|
||||||
|
fderivs(ex, Sphi, Kx, Ky, Kz, X, Y, Z, 1.0, 1.0, 1.0, Symmetry, Lev);
|
||||||
|
fdderivs(ex, Sphi, fxx, fxy, fxz, fyy, fyz, fzz, X, Y, Z, 1.0, 1.0, 1.0, Symmetry, Lev);
|
||||||
|
|
||||||
|
f_frpotential(ex, Sphi, V, dVdSphi);
|
||||||
|
|
||||||
|
for (int i = 0; i < all; ++i)
|
||||||
|
{
|
||||||
|
const double alpn1 = Lap[i] + ONE;
|
||||||
|
const double chin1 = chi[i] + ONE;
|
||||||
|
const double gxx = dxx[i] + ONE;
|
||||||
|
const double gyy = dyy[i] + ONE;
|
||||||
|
const double gzz = dzz[i] + ONE;
|
||||||
|
const double det = gxx * gyy * gzz + gxy[i] * gyz[i] * gxz[i] + gxz[i] * gxy[i] * gyz[i]
|
||||||
|
- gxz[i] * gyy * gxz[i] - gxy[i] * gxy[i] * gzz - gxx * gyz[i] * gyz[i];
|
||||||
|
const double gupxx = (gyy * gzz - gyz[i] * gyz[i]) / det;
|
||||||
|
const double gupxy = -(gxy[i] * gzz - gyz[i] * gxz[i]) / det;
|
||||||
|
const double gupxz = (gxy[i] * gyz[i] - gyy * gxz[i]) / det;
|
||||||
|
const double gupyy = (gxx * gzz - gxz[i] * gxz[i]) / det;
|
||||||
|
const double gupyz = -(gxx * gyz[i] - gxy[i] * gxz[i]) / det;
|
||||||
|
const double gupzz = (gxx * gyy - gxy[i] * gxy[i]) / det;
|
||||||
|
|
||||||
|
Sphi_rhs[i] = alpn1 * Spi[i];
|
||||||
|
|
||||||
|
Spi_rhs[i] = gupxx * fxx[i] + gupyy * fyy[i] + gupzz * fzz[i]
|
||||||
|
+ TWO * (gupxy * fxy[i] + gupxz * fxz[i] + gupyz * fyz[i])
|
||||||
|
- ((Gamx[i] + (gupxx * chix[i] + gupxy * chiy[i] + gupxz * chiz[i]) / TWO / chin1) * Kx[i]
|
||||||
|
+ (Gamy[i] + (gupxy * chix[i] + gupyy * chiy[i] + gupyz * chiz[i]) / TWO / chin1) * Ky[i]
|
||||||
|
+ (Gamz[i] + (gupxz * chix[i] + gupyz * chiy[i] + gupzz * chiz[i]) / TWO / chin1) * Kz[i]);
|
||||||
|
|
||||||
|
Spi_rhs[i] = Spi_rhs[i] * alpn1
|
||||||
|
+ gupxx * Lapx[i] * Kx[i] + gupxy * Lapx[i] * Ky[i] + gupxz * Lapx[i] * Kz[i]
|
||||||
|
+ gupxy * Lapy[i] * Kx[i] + gupyy * Lapy[i] * Ky[i] + gupyz * Lapy[i] * Kz[i]
|
||||||
|
+ gupxz * Lapz[i] * Kx[i] + gupyz * Lapz[i] * Ky[i] + gupzz * Lapz[i] * Kz[i];
|
||||||
|
|
||||||
|
Spi_rhs[i] = Spi_rhs[i] * chin1 + alpn1 * (trK[i] * Spi[i] - dVdSphi[i]);
|
||||||
|
|
||||||
|
rho[i] = chin1 * ((gupxx * Kx[i] * Kx[i] + gupyy * Ky[i] * Ky[i] + gupzz * Kz[i] * Kz[i]) * HALF
|
||||||
|
+ gupxy * Kx[i] * Ky[i] + gupxz * Kx[i] * Kz[i] + gupyz * Ky[i] * Kz[i])
|
||||||
|
+ Spi[i] * Spi[i] * HALF + V[i];
|
||||||
|
Sx[i] = -Spi[i] * Kx[i];
|
||||||
|
Sy[i] = -Spi[i] * Ky[i];
|
||||||
|
Sz[i] = -Spi[i] * Kz[i];
|
||||||
|
|
||||||
|
const double pressure = (rho[i] - Spi[i] * Spi[i]) / chin1;
|
||||||
|
Sxx[i] = Kx[i] * Kx[i] - pressure * gxx;
|
||||||
|
Sxy[i] = Kx[i] * Ky[i] - pressure * gxy[i];
|
||||||
|
Sxz[i] = Kx[i] * Kz[i] - pressure * gxz[i];
|
||||||
|
Syy[i] = Ky[i] * Ky[i] - pressure * gyy;
|
||||||
|
Syz[i] = Ky[i] * Kz[i] - pressure * gyz[i];
|
||||||
|
Szz[i] = Kz[i] * Kz[i] - pressure * gzz;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (f_compute_rhs_bssn(ex, T, X, Y, Z,
|
||||||
|
chi, trK,
|
||||||
|
dxx, gxy, gxz, dyy, gyz, dzz,
|
||||||
|
Axx, Axy, Axz, Ayy, Ayz, Azz,
|
||||||
|
Gamx, Gamy, Gamz,
|
||||||
|
Lap, betax, betay, betaz,
|
||||||
|
dtSfx, dtSfy, dtSfz,
|
||||||
|
chi_rhs, trK_rhs,
|
||||||
|
gxx_rhs, gxy_rhs, gxz_rhs, gyy_rhs, gyz_rhs, gzz_rhs,
|
||||||
|
Axx_rhs, Axy_rhs, Axz_rhs, Ayy_rhs, Ayz_rhs, Azz_rhs,
|
||||||
|
Gamx_rhs, Gamy_rhs, Gamz_rhs,
|
||||||
|
Lap_rhs, betax_rhs, betay_rhs, betaz_rhs,
|
||||||
|
dtSfx_rhs, dtSfy_rhs, dtSfz_rhs,
|
||||||
|
rho, Sx, Sy, Sz,
|
||||||
|
Sxx, Sxy, Sxz, Syy, Syz, Szz,
|
||||||
|
Gamxxx, Gamxxy, Gamxxz, Gamxyy, Gamxyz, Gamxzz,
|
||||||
|
Gamyxx, Gamyxy, Gamyxz, Gamyyy, Gamyyz, Gamyzz,
|
||||||
|
Gamzxx, Gamzxy, Gamzxz, Gamzyy, Gamzyz, Gamzzz,
|
||||||
|
Rxx, Rxy, Rxz, Ryy, Ryz, Rzz,
|
||||||
|
ham_Res, movx_Res, movy_Res, movz_Res,
|
||||||
|
Gmx_Res, Gmy_Res, Gmz_Res,
|
||||||
|
Symmetry, Lev, eps, co))
|
||||||
|
return 1;
|
||||||
|
|
||||||
|
lopsided_kodis(ex, X, Y, Z, Sphi, Sphi_rhs, betax, betay, betaz, Symmetry, SSS, eps);
|
||||||
|
lopsided_kodis(ex, X, Y, Z, Spi, Spi_rhs, betax, betay, betaz, Symmetry, SSS, eps);
|
||||||
|
|
||||||
|
for (int i = 0; i < all; ++i)
|
||||||
|
{
|
||||||
|
if (Sphi_rhs[i] != Sphi_rhs[i] || Spi_rhs[i] != Spi_rhs[i] || rho[i] != rho[i])
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
@@ -59,9 +59,10 @@
|
|||||||
real*8, dimension(ex(1),ex(2),ex(3)),intent(out) :: Rxx,Rxy,Rxz,Ryy,Ryz,Rzz
|
real*8, dimension(ex(1),ex(2),ex(3)),intent(out) :: Rxx,Rxy,Rxz,Ryy,Ryz,Rzz
|
||||||
real*8,intent(in) :: eps
|
real*8,intent(in) :: eps
|
||||||
real*8, dimension(ex(1),ex(2),ex(3)),intent(inout) :: ham_Res, movx_Res, movy_Res, movz_Res
|
real*8, dimension(ex(1),ex(2),ex(3)),intent(inout) :: ham_Res, movx_Res, movy_Res, movz_Res
|
||||||
real*8, dimension(ex(1),ex(2),ex(3)),intent(inout) :: Gmx_Res, Gmy_Res, Gmz_Res
|
real*8, dimension(ex(1),ex(2),ex(3)),intent(inout) :: Gmx_Res, Gmy_Res, Gmz_Res
|
||||||
! gont = 0: success; gont = 1: something wrong
|
! gont = 0: success; gont = 1: something wrong
|
||||||
integer::gont
|
integer::gont
|
||||||
|
integer :: i,j,k
|
||||||
|
|
||||||
!~~~~~~> Other variables:
|
!~~~~~~> Other variables:
|
||||||
|
|
||||||
@@ -83,11 +84,18 @@
|
|||||||
real*8, dimension(ex(1),ex(2),ex(3)) :: gupxx,gupxy,gupxz
|
real*8, dimension(ex(1),ex(2),ex(3)) :: gupxx,gupxy,gupxz
|
||||||
real*8, dimension(ex(1),ex(2),ex(3)) :: gupyy,gupyz,gupzz
|
real*8, dimension(ex(1),ex(2),ex(3)) :: gupyy,gupyz,gupzz
|
||||||
|
|
||||||
real*8,dimension(3) ::SSS,AAS,ASA,SAA,ASS,SAS,SSA
|
real*8,dimension(3) ::SSS,AAS,ASA,SAA,ASS,SAS,SSA
|
||||||
real*8 :: dX, dY, dZ, PI
|
real*8 :: dX, dY, dZ, PI
|
||||||
real*8, parameter :: ZEO = 0.d0,ONE = 1.D0, TWO = 2.D0, FOUR = 4.D0
|
real*8 :: divb_loc,det_loc
|
||||||
real*8, parameter :: EIGHT = 8.D0, HALF = 0.5D0, THR = 3.d0
|
real*8 :: gupxx_loc,gupxy_loc,gupxz_loc,gupyy_loc,gupyz_loc,gupzz_loc
|
||||||
real*8, parameter :: SYM = 1.D0, ANTI= - 1.D0
|
real*8 :: Rxx_loc,Rxy_loc,Rxz_loc,Ryy_loc,Ryz_loc,Rzz_loc
|
||||||
|
real*8 :: fxx_loc,fxy_loc,fxz_loc
|
||||||
|
real*8 :: Gamxa_loc,Gamya_loc,Gamza_loc
|
||||||
|
real*8 :: f_loc,chin_loc
|
||||||
|
real*8 :: l_fxx,l_fxy,l_fxz,l_fyy,l_fyz,l_fzz,S_loc
|
||||||
|
real*8, parameter :: ZEO = 0.d0,ONE = 1.D0, TWO = 2.D0, FOUR = 4.D0
|
||||||
|
real*8, parameter :: EIGHT = 8.D0, HALF = 0.5D0, THR = 3.d0
|
||||||
|
real*8, parameter :: SYM = 1.D0, ANTI= - 1.D0
|
||||||
double precision,parameter::FF = 0.75d0,eta=2.d0
|
double precision,parameter::FF = 0.75d0,eta=2.d0
|
||||||
real*8, parameter :: F1o3 = 1.D0/3.D0, F2o3 = 2.D0/3.D0,F3o2=1.5d0, F1o6 = 1.D0/6.D0
|
real*8, parameter :: F1o3 = 1.D0/3.D0, F2o3 = 2.D0/3.D0,F3o2=1.5d0, F1o6 = 1.D0/6.D0
|
||||||
real*8, parameter :: F16=1.6d1,F8=8.d0
|
real*8, parameter :: F16=1.6d1,F8=8.d0
|
||||||
@@ -96,11 +104,11 @@
|
|||||||
real*8, dimension(ex(1),ex(2),ex(3)) :: reta
|
real*8, dimension(ex(1),ex(2),ex(3)) :: reta
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
#if (GAUGE == 6 || GAUGE == 7)
|
#if (GAUGE == 6 || GAUGE == 7)
|
||||||
integer :: BHN,i,j,k
|
integer :: BHN
|
||||||
real*8, dimension(9) :: Porg
|
real*8, dimension(9) :: Porg
|
||||||
real*8, dimension(3) :: Mass
|
real*8, dimension(3) :: Mass
|
||||||
real*8 :: r1,r2,M,A,w1,w2,C1,C2
|
real*8 :: r1,r2,M,A,w1,w2,C1,C2
|
||||||
real*8, dimension(ex(1),ex(2),ex(3)) :: reta
|
real*8, dimension(ex(1),ex(2),ex(3)) :: reta
|
||||||
|
|
||||||
call getpbh(BHN,Porg,Mass)
|
call getpbh(BHN,Porg,Mass)
|
||||||
@@ -145,174 +153,204 @@
|
|||||||
dY = Y(2) - Y(1)
|
dY = Y(2) - Y(1)
|
||||||
dZ = Z(2) - Z(1)
|
dZ = Z(2) - Z(1)
|
||||||
|
|
||||||
alpn1 = Lap + ONE
|
do k=1,ex(3)
|
||||||
chin1 = chi + ONE
|
do j=1,ex(2)
|
||||||
gxx = dxx + ONE
|
do i=1,ex(1)
|
||||||
gyy = dyy + ONE
|
alpn1(i,j,k) = Lap(i,j,k) + ONE
|
||||||
gzz = dzz + ONE
|
chin1(i,j,k) = chi(i,j,k) + ONE
|
||||||
|
gxx(i,j,k) = dxx(i,j,k) + ONE
|
||||||
|
gyy(i,j,k) = dyy(i,j,k) + ONE
|
||||||
|
gzz(i,j,k) = dzz(i,j,k) + ONE
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
|
||||||
call fderivs(ex,betax,betaxx,betaxy,betaxz,X,Y,Z,ANTI, SYM, SYM,Symmetry,Lev)
|
call fderivs(ex,betax,betaxx,betaxy,betaxz,X,Y,Z,ANTI, SYM, SYM,Symmetry,Lev)
|
||||||
call fderivs(ex,betay,betayx,betayy,betayz,X,Y,Z, SYM,ANTI, SYM,Symmetry,Lev)
|
call fderivs(ex,betay,betayx,betayy,betayz,X,Y,Z, SYM,ANTI, SYM,Symmetry,Lev)
|
||||||
call fderivs(ex,betaz,betazx,betazy,betazz,X,Y,Z, SYM, SYM,ANTI,Symmetry,Lev)
|
call fderivs(ex,betaz,betazx,betazy,betazz,X,Y,Z, SYM, SYM,ANTI,Symmetry,Lev)
|
||||||
|
|
||||||
div_beta = betaxx + betayy + betazz
|
call fderivs(ex,chi,chix,chiy,chiz,X,Y,Z,SYM,SYM,SYM,symmetry,Lev)
|
||||||
|
|
||||||
call fderivs(ex,chi,chix,chiy,chiz,X,Y,Z,SYM,SYM,SYM,symmetry,Lev)
|
|
||||||
|
|
||||||
chi_rhs = F2o3 *chin1*( alpn1 * trK - div_beta ) !rhs for chi
|
call fderivs(ex,dxx,gxxx,gxxy,gxxz,X,Y,Z,SYM ,SYM ,SYM ,Symmetry,Lev)
|
||||||
|
call fderivs(ex,gxy,gxyx,gxyy,gxyz,X,Y,Z,ANTI,ANTI,SYM ,Symmetry,Lev)
|
||||||
call fderivs(ex,dxx,gxxx,gxxy,gxxz,X,Y,Z,SYM ,SYM ,SYM ,Symmetry,Lev)
|
call fderivs(ex,gxz,gxzx,gxzy,gxzz,X,Y,Z,ANTI,SYM ,ANTI,Symmetry,Lev)
|
||||||
call fderivs(ex,gxy,gxyx,gxyy,gxyz,X,Y,Z,ANTI,ANTI,SYM ,Symmetry,Lev)
|
call fderivs(ex,dyy,gyyx,gyyy,gyyz,X,Y,Z,SYM ,SYM ,SYM ,Symmetry,Lev)
|
||||||
call fderivs(ex,gxz,gxzx,gxzy,gxzz,X,Y,Z,ANTI,SYM ,ANTI,Symmetry,Lev)
|
call fderivs(ex,gyz,gyzx,gyzy,gyzz,X,Y,Z,SYM ,ANTI,ANTI,Symmetry,Lev)
|
||||||
call fderivs(ex,dyy,gyyx,gyyy,gyyz,X,Y,Z,SYM ,SYM ,SYM ,Symmetry,Lev)
|
call fderivs(ex,dzz,gzzx,gzzy,gzzz,X,Y,Z,SYM ,SYM ,SYM ,Symmetry,Lev)
|
||||||
call fderivs(ex,gyz,gyzx,gyzy,gyzz,X,Y,Z,SYM ,ANTI,ANTI,Symmetry,Lev)
|
|
||||||
call fderivs(ex,dzz,gzzx,gzzy,gzzz,X,Y,Z,SYM ,SYM ,SYM ,Symmetry,Lev)
|
do k=1,ex(3)
|
||||||
|
do j=1,ex(2)
|
||||||
gxx_rhs = - TWO * alpn1 * Axx - F2o3 * gxx * div_beta + &
|
do i=1,ex(1)
|
||||||
TWO *( gxx * betaxx + gxy * betayx + gxz * betazx)
|
divb_loc = betaxx(i,j,k) + betayy(i,j,k) + betazz(i,j,k)
|
||||||
|
div_beta(i,j,k) = divb_loc
|
||||||
gyy_rhs = - TWO * alpn1 * Ayy - F2o3 * gyy * div_beta + &
|
|
||||||
TWO *( gxy * betaxy + gyy * betayy + gyz * betazy)
|
chi_rhs(i,j,k) = F2o3 * chin1(i,j,k) * (alpn1(i,j,k) * trK(i,j,k) - divb_loc)
|
||||||
|
|
||||||
gzz_rhs = - TWO * alpn1 * Azz - F2o3 * gzz * div_beta + &
|
gxx_rhs(i,j,k) = - TWO * alpn1(i,j,k) * Axx(i,j,k) - F2o3 * gxx(i,j,k) * divb_loc + &
|
||||||
TWO *( gxz * betaxz + gyz * betayz + gzz * betazz)
|
TWO * ( gxx(i,j,k) * betaxx(i,j,k) + gxy(i,j,k) * betayx(i,j,k) + gxz(i,j,k) * betazx(i,j,k) )
|
||||||
|
|
||||||
gxy_rhs = - TWO * alpn1 * Axy + F1o3 * gxy * div_beta + &
|
gyy_rhs(i,j,k) = - TWO * alpn1(i,j,k) * Ayy(i,j,k) - F2o3 * gyy(i,j,k) * divb_loc + &
|
||||||
gxx * betaxy + gxz * betazy + &
|
TWO * ( gxy(i,j,k) * betaxy(i,j,k) + gyy(i,j,k) * betayy(i,j,k) + gyz(i,j,k) * betazy(i,j,k) )
|
||||||
gyy * betayx + gyz * betazx &
|
|
||||||
- gxy * betazz
|
gzz_rhs(i,j,k) = - TWO * alpn1(i,j,k) * Azz(i,j,k) - F2o3 * gzz(i,j,k) * divb_loc + &
|
||||||
|
TWO * ( gxz(i,j,k) * betaxz(i,j,k) + gyz(i,j,k) * betayz(i,j,k) + gzz(i,j,k) * betazz(i,j,k) )
|
||||||
gyz_rhs = - TWO * alpn1 * Ayz + F1o3 * gyz * div_beta + &
|
|
||||||
gxy * betaxz + gyy * betayz + &
|
gxy_rhs(i,j,k) = - TWO * alpn1(i,j,k) * Axy(i,j,k) + F1o3 * gxy(i,j,k) * divb_loc + &
|
||||||
gxz * betaxy + gzz * betazy &
|
gxx(i,j,k) * betaxy(i,j,k) + gxz(i,j,k) * betazy(i,j,k) + gyy(i,j,k) * betayx(i,j,k) + &
|
||||||
- gyz * betaxx
|
gyz(i,j,k) * betazx(i,j,k) - gxy(i,j,k) * betazz(i,j,k)
|
||||||
|
|
||||||
gxz_rhs = - TWO * alpn1 * Axz + F1o3 * gxz * div_beta + &
|
gyz_rhs(i,j,k) = - TWO * alpn1(i,j,k) * Ayz(i,j,k) + F1o3 * gyz(i,j,k) * divb_loc + &
|
||||||
gxx * betaxz + gxy * betayz + &
|
gxy(i,j,k) * betaxz(i,j,k) + gyy(i,j,k) * betayz(i,j,k) + gxz(i,j,k) * betaxy(i,j,k) + &
|
||||||
gyz * betayx + gzz * betazx &
|
gzz(i,j,k) * betazy(i,j,k) - gyz(i,j,k) * betaxx(i,j,k)
|
||||||
- gxz * betayy !rhs for gij
|
|
||||||
|
gxz_rhs(i,j,k) = - TWO * alpn1(i,j,k) * Axz(i,j,k) + F1o3 * gxz(i,j,k) * divb_loc + &
|
||||||
! invert tilted metric
|
gxx(i,j,k) * betaxz(i,j,k) + gxy(i,j,k) * betayz(i,j,k) + gyz(i,j,k) * betayx(i,j,k) + &
|
||||||
gupzz = gxx * gyy * gzz + gxy * gyz * gxz + gxz * gxy * gyz - &
|
gzz(i,j,k) * betazx(i,j,k) - gxz(i,j,k) * betayy(i,j,k)
|
||||||
gxz * gyy * gxz - gxy * gxy * gzz - gxx * gyz * gyz
|
|
||||||
gupxx = ( gyy * gzz - gyz * gyz ) / gupzz
|
det_loc = gxx(i,j,k) * gyy(i,j,k) * gzz(i,j,k) + gxy(i,j,k) * gyz(i,j,k) * gxz(i,j,k) + &
|
||||||
gupxy = - ( gxy * gzz - gyz * gxz ) / gupzz
|
gxz(i,j,k) * gxy(i,j,k) * gyz(i,j,k) - gxz(i,j,k) * gyy(i,j,k) * gxz(i,j,k) - &
|
||||||
gupxz = ( gxy * gyz - gyy * gxz ) / gupzz
|
gxy(i,j,k) * gxy(i,j,k) * gzz(i,j,k) - gxx(i,j,k) * gyz(i,j,k) * gyz(i,j,k)
|
||||||
gupyy = ( gxx * gzz - gxz * gxz ) / gupzz
|
gupxx_loc = ( gyy(i,j,k) * gzz(i,j,k) - gyz(i,j,k) * gyz(i,j,k) ) / det_loc
|
||||||
gupyz = - ( gxx * gyz - gxy * gxz ) / gupzz
|
gupxy_loc = - ( gxy(i,j,k) * gzz(i,j,k) - gyz(i,j,k) * gxz(i,j,k) ) / det_loc
|
||||||
gupzz = ( gxx * gyy - gxy * gxy ) / gupzz
|
gupxz_loc = ( gxy(i,j,k) * gyz(i,j,k) - gyy(i,j,k) * gxz(i,j,k) ) / det_loc
|
||||||
|
gupyy_loc = ( gxx(i,j,k) * gzz(i,j,k) - gxz(i,j,k) * gxz(i,j,k) ) / det_loc
|
||||||
if(co == 0)then
|
gupyz_loc = - ( gxx(i,j,k) * gyz(i,j,k) - gxy(i,j,k) * gxz(i,j,k) ) / det_loc
|
||||||
! Gam^i_Res = Gam^i + gup^ij_,j
|
gupzz_loc = ( gxx(i,j,k) * gyy(i,j,k) - gxy(i,j,k) * gxy(i,j,k) ) / det_loc
|
||||||
Gmx_Res = Gamx - (gupxx*(gupxx*gxxx+gupxy*gxyx+gupxz*gxzx)&
|
gupxx(i,j,k) = gupxx_loc
|
||||||
+gupxy*(gupxx*gxyx+gupxy*gyyx+gupxz*gyzx)&
|
gupxy(i,j,k) = gupxy_loc
|
||||||
+gupxz*(gupxx*gxzx+gupxy*gyzx+gupxz*gzzx)&
|
gupxz(i,j,k) = gupxz_loc
|
||||||
+gupxx*(gupxy*gxxy+gupyy*gxyy+gupyz*gxzy)&
|
gupyy(i,j,k) = gupyy_loc
|
||||||
+gupxy*(gupxy*gxyy+gupyy*gyyy+gupyz*gyzy)&
|
gupyz(i,j,k) = gupyz_loc
|
||||||
+gupxz*(gupxy*gxzy+gupyy*gyzy+gupyz*gzzy)&
|
gupzz(i,j,k) = gupzz_loc
|
||||||
+gupxx*(gupxz*gxxz+gupyz*gxyz+gupzz*gxzz)&
|
|
||||||
+gupxy*(gupxz*gxyz+gupyz*gyyz+gupzz*gyzz)&
|
if(co == 0)then
|
||||||
+gupxz*(gupxz*gxzz+gupyz*gyzz+gupzz*gzzz))
|
Gmx_Res(i,j,k) = Gamx(i,j,k) - ( &
|
||||||
Gmy_Res = Gamy - (gupxx*(gupxy*gxxx+gupyy*gxyx+gupyz*gxzx)&
|
gupxx_loc*(gupxx_loc*gxxx(i,j,k)+gupxy_loc*gxyx(i,j,k)+gupxz_loc*gxzx(i,j,k)) + &
|
||||||
+gupxy*(gupxy*gxyx+gupyy*gyyx+gupyz*gyzx)&
|
gupxy_loc*(gupxx_loc*gxyx(i,j,k)+gupxy_loc*gyyx(i,j,k)+gupxz_loc*gyzx(i,j,k)) + &
|
||||||
+gupxz*(gupxy*gxzx+gupyy*gyzx+gupyz*gzzx)&
|
gupxz_loc*(gupxx_loc*gxzx(i,j,k)+gupxy_loc*gyzx(i,j,k)+gupxz_loc*gzzx(i,j,k)) + &
|
||||||
+gupxy*(gupxy*gxxy+gupyy*gxyy+gupyz*gxzy)&
|
gupxx_loc*(gupxy_loc*gxxy(i,j,k)+gupyy_loc*gxyy(i,j,k)+gupyz_loc*gxzy(i,j,k)) + &
|
||||||
+gupyy*(gupxy*gxyy+gupyy*gyyy+gupyz*gyzy)&
|
gupxy_loc*(gupxy_loc*gxyy(i,j,k)+gupyy_loc*gyyy(i,j,k)+gupyz_loc*gyzy(i,j,k)) + &
|
||||||
+gupyz*(gupxy*gxzy+gupyy*gyzy+gupyz*gzzy)&
|
gupxz_loc*(gupxy_loc*gxzy(i,j,k)+gupyy_loc*gyzy(i,j,k)+gupyz_loc*gzzy(i,j,k)) + &
|
||||||
+gupxy*(gupxz*gxxz+gupyz*gxyz+gupzz*gxzz)&
|
gupxx_loc*(gupxz_loc*gxxz(i,j,k)+gupyz_loc*gxyz(i,j,k)+gupzz_loc*gxzz(i,j,k)) + &
|
||||||
+gupyy*(gupxz*gxyz+gupyz*gyyz+gupzz*gyzz)&
|
gupxy_loc*(gupxz_loc*gxyz(i,j,k)+gupyz_loc*gyyz(i,j,k)+gupzz_loc*gyzz(i,j,k)) + &
|
||||||
+gupyz*(gupxz*gxzz+gupyz*gyzz+gupzz*gzzz))
|
gupxz_loc*(gupxz_loc*gxzz(i,j,k)+gupyz_loc*gyzz(i,j,k)+gupzz_loc*gzzz(i,j,k)))
|
||||||
Gmz_Res = Gamz - (gupxx*(gupxz*gxxx+gupyz*gxyx+gupzz*gxzx)&
|
Gmy_Res(i,j,k) = Gamy(i,j,k) - ( &
|
||||||
+gupxy*(gupxz*gxyx+gupyz*gyyx+gupzz*gyzx)&
|
gupxx_loc*(gupxy_loc*gxxx(i,j,k)+gupyy_loc*gxyx(i,j,k)+gupyz_loc*gxzx(i,j,k)) + &
|
||||||
+gupxz*(gupxz*gxzx+gupyz*gyzx+gupzz*gzzx)&
|
gupxy_loc*(gupxy_loc*gxyx(i,j,k)+gupyy_loc*gyyx(i,j,k)+gupyz_loc*gyzx(i,j,k)) + &
|
||||||
+gupxy*(gupxz*gxxy+gupyz*gxyy+gupzz*gxzy)&
|
gupxz_loc*(gupxy_loc*gxzx(i,j,k)+gupyy_loc*gyzx(i,j,k)+gupyz_loc*gzzx(i,j,k)) + &
|
||||||
+gupyy*(gupxz*gxyy+gupyz*gyyy+gupzz*gyzy)&
|
gupxy_loc*(gupxy_loc*gxxy(i,j,k)+gupyy_loc*gxyy(i,j,k)+gupyz_loc*gxzy(i,j,k)) + &
|
||||||
+gupyz*(gupxz*gxzy+gupyz*gyzy+gupzz*gzzy)&
|
gupyy_loc*(gupxy_loc*gxyy(i,j,k)+gupyy_loc*gyyy(i,j,k)+gupyz_loc*gyzy(i,j,k)) + &
|
||||||
+gupxz*(gupxz*gxxz+gupyz*gxyz+gupzz*gxzz)&
|
gupyz_loc*(gupxy_loc*gxzy(i,j,k)+gupyy_loc*gyzy(i,j,k)+gupyz_loc*gzzy(i,j,k)) + &
|
||||||
+gupyz*(gupxz*gxyz+gupyz*gyyz+gupzz*gyzz)&
|
gupxy_loc*(gupxz_loc*gxxz(i,j,k)+gupyz_loc*gxyz(i,j,k)+gupzz_loc*gxzz(i,j,k)) + &
|
||||||
+gupzz*(gupxz*gxzz+gupyz*gyzz+gupzz*gzzz))
|
gupyy_loc*(gupxz_loc*gxyz(i,j,k)+gupyz_loc*gyyz(i,j,k)+gupzz_loc*gyzz(i,j,k)) + &
|
||||||
endif
|
gupyz_loc*(gupxz_loc*gxzz(i,j,k)+gupyz_loc*gyzz(i,j,k)+gupzz_loc*gzzz(i,j,k)))
|
||||||
|
Gmz_Res(i,j,k) = Gamz(i,j,k) - ( &
|
||||||
! second kind of connection
|
gupxx_loc*(gupxz_loc*gxxx(i,j,k)+gupyz_loc*gxyx(i,j,k)+gupzz_loc*gxzx(i,j,k)) + &
|
||||||
Gamxxx =HALF*( gupxx*gxxx + gupxy*(TWO*gxyx - gxxy ) + gupxz*(TWO*gxzx - gxxz ))
|
gupxy_loc*(gupxz_loc*gxyx(i,j,k)+gupyz_loc*gyyx(i,j,k)+gupzz_loc*gyzx(i,j,k)) + &
|
||||||
Gamyxx =HALF*( gupxy*gxxx + gupyy*(TWO*gxyx - gxxy ) + gupyz*(TWO*gxzx - gxxz ))
|
gupxz_loc*(gupxz_loc*gxzx(i,j,k)+gupyz_loc*gyzx(i,j,k)+gupzz_loc*gzzx(i,j,k)) + &
|
||||||
Gamzxx =HALF*( gupxz*gxxx + gupyz*(TWO*gxyx - gxxy ) + gupzz*(TWO*gxzx - gxxz ))
|
gupxy_loc*(gupxz_loc*gxxy(i,j,k)+gupyz_loc*gxyy(i,j,k)+gupzz_loc*gxzy(i,j,k)) + &
|
||||||
|
gupyy_loc*(gupxz_loc*gxyy(i,j,k)+gupyz_loc*gyyy(i,j,k)+gupzz_loc*gyzy(i,j,k)) + &
|
||||||
Gamxyy =HALF*( gupxx*(TWO*gxyy - gyyx ) + gupxy*gyyy + gupxz*(TWO*gyzy - gyyz ))
|
gupyz_loc*(gupxz_loc*gxzy(i,j,k)+gupyz_loc*gyzy(i,j,k)+gupzz_loc*gzzy(i,j,k)) + &
|
||||||
Gamyyy =HALF*( gupxy*(TWO*gxyy - gyyx ) + gupyy*gyyy + gupyz*(TWO*gyzy - gyyz ))
|
gupxz_loc*(gupxz_loc*gxxz(i,j,k)+gupyz_loc*gxyz(i,j,k)+gupzz_loc*gxzz(i,j,k)) + &
|
||||||
Gamzyy =HALF*( gupxz*(TWO*gxyy - gyyx ) + gupyz*gyyy + gupzz*(TWO*gyzy - gyyz ))
|
gupyz_loc*(gupxz_loc*gxyz(i,j,k)+gupyz_loc*gyyz(i,j,k)+gupzz_loc*gyzz(i,j,k)) + &
|
||||||
|
gupzz_loc*(gupxz_loc*gxzz(i,j,k)+gupyz_loc*gyzz(i,j,k)+gupzz_loc*gzzz(i,j,k)))
|
||||||
Gamxzz =HALF*( gupxx*(TWO*gxzz - gzzx ) + gupxy*(TWO*gyzz - gzzy ) + gupxz*gzzz)
|
endif
|
||||||
Gamyzz =HALF*( gupxy*(TWO*gxzz - gzzx ) + gupyy*(TWO*gyzz - gzzy ) + gupyz*gzzz)
|
|
||||||
Gamzzz =HALF*( gupxz*(TWO*gxzz - gzzx ) + gupyz*(TWO*gyzz - gzzy ) + gupzz*gzzz)
|
Gamxxx(i,j,k)=HALF*( gupxx_loc*gxxx(i,j,k) + gupxy_loc*(TWO*gxyx(i,j,k) - gxxy(i,j,k)) + gupxz_loc*(TWO*gxzx(i,j,k) - gxxz(i,j,k)))
|
||||||
|
Gamyxx(i,j,k)=HALF*( gupxy_loc*gxxx(i,j,k) + gupyy_loc*(TWO*gxyx(i,j,k) - gxxy(i,j,k)) + gupyz_loc*(TWO*gxzx(i,j,k) - gxxz(i,j,k)))
|
||||||
Gamxxy =HALF*( gupxx*gxxy + gupxy*gyyx + gupxz*( gxzy + gyzx - gxyz ) )
|
Gamzxx(i,j,k)=HALF*( gupxz_loc*gxxx(i,j,k) + gupyz_loc*(TWO*gxyx(i,j,k) - gxxy(i,j,k)) + gupzz_loc*(TWO*gxzx(i,j,k) - gxxz(i,j,k)))
|
||||||
Gamyxy =HALF*( gupxy*gxxy + gupyy*gyyx + gupyz*( gxzy + gyzx - gxyz ) )
|
|
||||||
Gamzxy =HALF*( gupxz*gxxy + gupyz*gyyx + gupzz*( gxzy + gyzx - gxyz ) )
|
Gamxyy(i,j,k)=HALF*( gupxx_loc*(TWO*gxyy(i,j,k) - gyyx(i,j,k)) + gupxy_loc*gyyy(i,j,k) + gupxz_loc*(TWO*gyzy(i,j,k) - gyyz(i,j,k)))
|
||||||
|
Gamyyy(i,j,k)=HALF*( gupxy_loc*(TWO*gxyy(i,j,k) - gyyx(i,j,k)) + gupyy_loc*gyyy(i,j,k) + gupyz_loc*(TWO*gyzy(i,j,k) - gyyz(i,j,k)))
|
||||||
Gamxxz =HALF*( gupxx*gxxz + gupxy*( gxyz + gyzx - gxzy ) + gupxz*gzzx )
|
Gamzyy(i,j,k)=HALF*( gupxz_loc*(TWO*gxyy(i,j,k) - gyyx(i,j,k)) + gupyz_loc*gyyy(i,j,k) + gupzz_loc*(TWO*gyzy(i,j,k) - gyyz(i,j,k)))
|
||||||
Gamyxz =HALF*( gupxy*gxxz + gupyy*( gxyz + gyzx - gxzy ) + gupyz*gzzx )
|
|
||||||
Gamzxz =HALF*( gupxz*gxxz + gupyz*( gxyz + gyzx - gxzy ) + gupzz*gzzx )
|
Gamxzz(i,j,k)=HALF*( gupxx_loc*(TWO*gxzz(i,j,k) - gzzx(i,j,k)) + gupxy_loc*(TWO*gyzz(i,j,k) - gzzy(i,j,k)) + gupxz_loc*gzzz(i,j,k))
|
||||||
|
Gamyzz(i,j,k)=HALF*( gupxy_loc*(TWO*gxzz(i,j,k) - gzzx(i,j,k)) + gupyy_loc*(TWO*gyzz(i,j,k) - gzzy(i,j,k)) + gupyz_loc*gzzz(i,j,k))
|
||||||
Gamxyz =HALF*( gupxx*( gxyz + gxzy - gyzx ) + gupxy*gyyz + gupxz*gzzy )
|
Gamzzz(i,j,k)=HALF*( gupxz_loc*(TWO*gxzz(i,j,k) - gzzx(i,j,k)) + gupyz_loc*(TWO*gyzz(i,j,k) - gzzy(i,j,k)) + gupzz_loc*gzzz(i,j,k))
|
||||||
Gamyyz =HALF*( gupxy*( gxyz + gxzy - gyzx ) + gupyy*gyyz + gupyz*gzzy )
|
|
||||||
Gamzyz =HALF*( gupxz*( gxyz + gxzy - gyzx ) + gupyz*gyyz + gupzz*gzzy )
|
Gamxxy(i,j,k)=HALF*( gupxx_loc*gxxy(i,j,k) + gupxy_loc*gyyx(i,j,k) + gupxz_loc*(gxzy(i,j,k) + gyzx(i,j,k) - gxyz(i,j,k)) )
|
||||||
! Raise indices of \tilde A_{ij} and store in R_ij
|
Gamyxy(i,j,k)=HALF*( gupxy_loc*gxxy(i,j,k) + gupyy_loc*gyyx(i,j,k) + gupyz_loc*(gxzy(i,j,k) + gyzx(i,j,k) - gxyz(i,j,k)) )
|
||||||
|
Gamzxy(i,j,k)=HALF*( gupxz_loc*gxxy(i,j,k) + gupyz_loc*gyyx(i,j,k) + gupzz_loc*(gxzy(i,j,k) + gyzx(i,j,k) - gxyz(i,j,k)) )
|
||||||
Rxx = gupxx * gupxx * Axx + gupxy * gupxy * Ayy + gupxz * gupxz * Azz + &
|
|
||||||
TWO*(gupxx * gupxy * Axy + gupxx * gupxz * Axz + gupxy * gupxz * Ayz)
|
Gamxxz(i,j,k)=HALF*( gupxx_loc*gxxz(i,j,k) + gupxy_loc*(gxyz(i,j,k) + gyzx(i,j,k) - gxzy(i,j,k)) + gupxz_loc*gzzx(i,j,k) )
|
||||||
|
Gamyxz(i,j,k)=HALF*( gupxy_loc*gxxz(i,j,k) + gupyy_loc*(gxyz(i,j,k) + gyzx(i,j,k) - gxzy(i,j,k)) + gupyz_loc*gzzx(i,j,k) )
|
||||||
Ryy = gupxy * gupxy * Axx + gupyy * gupyy * Ayy + gupyz * gupyz * Azz + &
|
Gamzxz(i,j,k)=HALF*( gupxz_loc*gxxz(i,j,k) + gupyz_loc*(gxyz(i,j,k) + gyzx(i,j,k) - gxzy(i,j,k)) + gupzz_loc*gzzx(i,j,k) )
|
||||||
TWO*(gupxy * gupyy * Axy + gupxy * gupyz * Axz + gupyy * gupyz * Ayz)
|
|
||||||
|
Gamxyz(i,j,k)=HALF*( gupxx_loc*(gxyz(i,j,k) + gxzy(i,j,k) - gyzx(i,j,k)) + gupxy_loc*gyyz(i,j,k) + gupxz_loc*gzzy(i,j,k) )
|
||||||
Rzz = gupxz * gupxz * Axx + gupyz * gupyz * Ayy + gupzz * gupzz * Azz + &
|
Gamyyz(i,j,k)=HALF*( gupxy_loc*(gxyz(i,j,k) + gxzy(i,j,k) - gyzx(i,j,k)) + gupyy_loc*gyyz(i,j,k) + gupyz_loc*gzzy(i,j,k) )
|
||||||
TWO*(gupxz * gupyz * Axy + gupxz * gupzz * Axz + gupyz * gupzz * Ayz)
|
Gamzyz(i,j,k)=HALF*( gupxz_loc*(gxyz(i,j,k) + gxzy(i,j,k) - gyzx(i,j,k)) + gupyz_loc*gyyz(i,j,k) + gupzz_loc*gzzy(i,j,k) )
|
||||||
|
enddo
|
||||||
Rxy = gupxx * gupxy * Axx + gupxy * gupyy * Ayy + gupxz * gupyz * Azz + &
|
enddo
|
||||||
(gupxx * gupyy + gupxy * gupxy)* Axy + &
|
enddo
|
||||||
(gupxx * gupyz + gupxz * gupxy)* Axz + &
|
! Raise indices of \tilde A_{ij} and store in R_ij
|
||||||
(gupxy * gupyz + gupxz * gupyy)* Ayz
|
|
||||||
|
! Right hand side for Gam^i without shift terms...
|
||||||
Rxz = gupxx * gupxz * Axx + gupxy * gupyz * Ayy + gupxz * gupzz * Azz + &
|
call fderivs(ex,Lap,Lapx,Lapy,Lapz,X,Y,Z,SYM,SYM,SYM,Symmetry,Lev)
|
||||||
(gupxx * gupyz + gupxy * gupxz)* Axy + &
|
call fderivs(ex,trK,Kx,Ky,Kz,X,Y,Z,SYM,SYM,SYM,symmetry,Lev)
|
||||||
(gupxx * gupzz + gupxz * gupxz)* Axz + &
|
do k=1,ex(3)
|
||||||
(gupxy * gupzz + gupxz * gupyz)* Ayz
|
do j=1,ex(2)
|
||||||
|
do i=1,ex(1)
|
||||||
Ryz = gupxy * gupxz * Axx + gupyy * gupyz * Ayy + gupyz * gupzz * Azz + &
|
gupxx_loc = gupxx(i,j,k)
|
||||||
(gupxy * gupyz + gupyy * gupxz)* Axy + &
|
gupxy_loc = gupxy(i,j,k)
|
||||||
(gupxy * gupzz + gupyz * gupxz)* Axz + &
|
gupxz_loc = gupxz(i,j,k)
|
||||||
(gupyy * gupzz + gupyz * gupyz)* Ayz
|
gupyy_loc = gupyy(i,j,k)
|
||||||
|
gupyz_loc = gupyz(i,j,k)
|
||||||
! Right hand side for Gam^i without shift terms...
|
gupzz_loc = gupzz(i,j,k)
|
||||||
call fderivs(ex,Lap,Lapx,Lapy,Lapz,X,Y,Z,SYM,SYM,SYM,Symmetry,Lev)
|
|
||||||
call fderivs(ex,trK,Kx,Ky,Kz,X,Y,Z,SYM,SYM,SYM,symmetry,Lev)
|
Rxx_loc = gupxx_loc * gupxx_loc * Axx(i,j,k) + gupxy_loc * gupxy_loc * Ayy(i,j,k) + gupxz_loc * gupxz_loc * Azz(i,j,k) + &
|
||||||
|
TWO * (gupxx_loc * gupxy_loc * Axy(i,j,k) + gupxx_loc * gupxz_loc * Axz(i,j,k) + gupxy_loc * gupxz_loc * Ayz(i,j,k))
|
||||||
Gamx_rhs = - TWO * ( Lapx * Rxx + Lapy * Rxy + Lapz * Rxz ) + &
|
Ryy_loc = gupxy_loc * gupxy_loc * Axx(i,j,k) + gupyy_loc * gupyy_loc * Ayy(i,j,k) + gupyz_loc * gupyz_loc * Azz(i,j,k) + &
|
||||||
TWO * alpn1 * ( &
|
TWO * (gupxy_loc * gupyy_loc * Axy(i,j,k) + gupxy_loc * gupyz_loc * Axz(i,j,k) + gupyy_loc * gupyz_loc * Ayz(i,j,k))
|
||||||
-F3o2/chin1 * ( chix * Rxx + chiy * Rxy + chiz * Rxz ) - &
|
Rzz_loc = gupxz_loc * gupxz_loc * Axx(i,j,k) + gupyz_loc * gupyz_loc * Ayy(i,j,k) + gupzz_loc * gupzz_loc * Azz(i,j,k) + &
|
||||||
gupxx * ( F2o3 * Kx + EIGHT * PI * Sx ) - &
|
TWO * (gupxz_loc * gupyz_loc * Axy(i,j,k) + gupxz_loc * gupzz_loc * Axz(i,j,k) + gupyz_loc * gupzz_loc * Ayz(i,j,k))
|
||||||
gupxy * ( F2o3 * Ky + EIGHT * PI * Sy ) - &
|
Rxy_loc = gupxx_loc * gupxy_loc * Axx(i,j,k) + gupxy_loc * gupyy_loc * Ayy(i,j,k) + gupxz_loc * gupyz_loc * Azz(i,j,k) + &
|
||||||
gupxz * ( F2o3 * Kz + EIGHT * PI * Sz ) + &
|
(gupxx_loc * gupyy_loc + gupxy_loc * gupxy_loc) * Axy(i,j,k) + &
|
||||||
Gamxxx * Rxx + Gamxyy * Ryy + Gamxzz * Rzz + &
|
(gupxx_loc * gupyz_loc + gupxz_loc * gupxy_loc) * Axz(i,j,k) + &
|
||||||
TWO * ( Gamxxy * Rxy + Gamxxz * Rxz + Gamxyz * Ryz ) )
|
(gupxy_loc * gupyz_loc + gupxz_loc * gupyy_loc) * Ayz(i,j,k)
|
||||||
|
Rxz_loc = gupxx_loc * gupxz_loc * Axx(i,j,k) + gupxy_loc * gupyz_loc * Ayy(i,j,k) + gupxz_loc * gupzz_loc * Azz(i,j,k) + &
|
||||||
Gamy_rhs = - TWO * ( Lapx * Rxy + Lapy * Ryy + Lapz * Ryz ) + &
|
(gupxx_loc * gupyz_loc + gupxy_loc * gupxz_loc) * Axy(i,j,k) + &
|
||||||
TWO * alpn1 * ( &
|
(gupxx_loc * gupzz_loc + gupxz_loc * gupxz_loc) * Axz(i,j,k) + &
|
||||||
-F3o2/chin1 * ( chix * Rxy + chiy * Ryy + chiz * Ryz ) - &
|
(gupxy_loc * gupzz_loc + gupxz_loc * gupyz_loc) * Ayz(i,j,k)
|
||||||
gupxy * ( F2o3 * Kx + EIGHT * PI * Sx ) - &
|
Ryz_loc = gupxy_loc * gupxz_loc * Axx(i,j,k) + gupyy_loc * gupyz_loc * Ayy(i,j,k) + gupyz_loc * gupzz_loc * Azz(i,j,k) + &
|
||||||
gupyy * ( F2o3 * Ky + EIGHT * PI * Sy ) - &
|
(gupxy_loc * gupyz_loc + gupyy_loc * gupxz_loc) * Axy(i,j,k) + &
|
||||||
gupyz * ( F2o3 * Kz + EIGHT * PI * Sz ) + &
|
(gupxy_loc * gupzz_loc + gupyz_loc * gupxz_loc) * Axz(i,j,k) + &
|
||||||
Gamyxx * Rxx + Gamyyy * Ryy + Gamyzz * Rzz + &
|
(gupyy_loc * gupzz_loc + gupyz_loc * gupyz_loc) * Ayz(i,j,k)
|
||||||
TWO * ( Gamyxy * Rxy + Gamyxz * Rxz + Gamyyz * Ryz ) )
|
Rxx(i,j,k) = Rxx_loc
|
||||||
|
Ryy(i,j,k) = Ryy_loc
|
||||||
Gamz_rhs = - TWO * ( Lapx * Rxz + Lapy * Ryz + Lapz * Rzz ) + &
|
Rzz(i,j,k) = Rzz_loc
|
||||||
TWO * alpn1 * ( &
|
Rxy(i,j,k) = Rxy_loc
|
||||||
-F3o2/chin1 * ( chix * Rxz + chiy * Ryz + chiz * Rzz ) - &
|
Rxz(i,j,k) = Rxz_loc
|
||||||
gupxz * ( F2o3 * Kx + EIGHT * PI * Sx ) - &
|
Ryz(i,j,k) = Ryz_loc
|
||||||
gupyz * ( F2o3 * Ky + EIGHT * PI * Sy ) - &
|
|
||||||
gupzz * ( F2o3 * Kz + EIGHT * PI * Sz ) + &
|
Gamx_rhs(i,j,k) = - TWO * (Lapx(i,j,k) * Rxx_loc + Lapy(i,j,k) * Rxy_loc + Lapz(i,j,k) * Rxz_loc) + &
|
||||||
Gamzxx * Rxx + Gamzyy * Ryy + Gamzzz * Rzz + &
|
TWO * alpn1(i,j,k) * ( &
|
||||||
TWO * ( Gamzxy * Rxy + Gamzxz * Rxz + Gamzyz * Ryz ) )
|
-F3o2/chin1(i,j,k) * (chix(i,j,k) * Rxx_loc + chiy(i,j,k) * Rxy_loc + chiz(i,j,k) * Rxz_loc) - &
|
||||||
|
gupxx_loc * (F2o3 * Kx(i,j,k) + EIGHT * PI * Sx(i,j,k)) - &
|
||||||
|
gupxy_loc * (F2o3 * Ky(i,j,k) + EIGHT * PI * Sy(i,j,k)) - &
|
||||||
|
gupxz_loc * (F2o3 * Kz(i,j,k) + EIGHT * PI * Sz(i,j,k)) + &
|
||||||
|
Gamxxx(i,j,k) * Rxx_loc + Gamxyy(i,j,k) * Ryy_loc + Gamxzz(i,j,k) * Rzz_loc + &
|
||||||
|
TWO * (Gamxxy(i,j,k) * Rxy_loc + Gamxxz(i,j,k) * Rxz_loc + Gamxyz(i,j,k) * Ryz_loc))
|
||||||
|
|
||||||
|
Gamy_rhs(i,j,k) = - TWO * (Lapx(i,j,k) * Rxy_loc + Lapy(i,j,k) * Ryy_loc + Lapz(i,j,k) * Ryz_loc) + &
|
||||||
|
TWO * alpn1(i,j,k) * ( &
|
||||||
|
-F3o2/chin1(i,j,k) * (chix(i,j,k) * Rxy_loc + chiy(i,j,k) * Ryy_loc + chiz(i,j,k) * Ryz_loc) - &
|
||||||
|
gupxy_loc * (F2o3 * Kx(i,j,k) + EIGHT * PI * Sx(i,j,k)) - &
|
||||||
|
gupyy_loc * (F2o3 * Ky(i,j,k) + EIGHT * PI * Sy(i,j,k)) - &
|
||||||
|
gupyz_loc * (F2o3 * Kz(i,j,k) + EIGHT * PI * Sz(i,j,k)) + &
|
||||||
|
Gamyxx(i,j,k) * Rxx_loc + Gamyyy(i,j,k) * Ryy_loc + Gamyzz(i,j,k) * Rzz_loc + &
|
||||||
|
TWO * (Gamyxy(i,j,k) * Rxy_loc + Gamyxz(i,j,k) * Rxz_loc + Gamyyz(i,j,k) * Ryz_loc))
|
||||||
|
|
||||||
|
Gamz_rhs(i,j,k) = - TWO * (Lapx(i,j,k) * Rxz_loc + Lapy(i,j,k) * Ryz_loc + Lapz(i,j,k) * Rzz_loc) + &
|
||||||
|
TWO * alpn1(i,j,k) * ( &
|
||||||
|
-F3o2/chin1(i,j,k) * (chix(i,j,k) * Rxz_loc + chiy(i,j,k) * Ryz_loc + chiz(i,j,k) * Rzz_loc) - &
|
||||||
|
gupxz_loc * (F2o3 * Kx(i,j,k) + EIGHT * PI * Sx(i,j,k)) - &
|
||||||
|
gupyz_loc * (F2o3 * Ky(i,j,k) + EIGHT * PI * Sy(i,j,k)) - &
|
||||||
|
gupzz_loc * (F2o3 * Kz(i,j,k) + EIGHT * PI * Sz(i,j,k)) + &
|
||||||
|
Gamzxx(i,j,k) * Rxx_loc + Gamzyy(i,j,k) * Ryy_loc + Gamzzz(i,j,k) * Rzz_loc + &
|
||||||
|
TWO * (Gamzxy(i,j,k) * Rxy_loc + Gamzxz(i,j,k) * Rxz_loc + Gamzyz(i,j,k) * Ryz_loc))
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
|
||||||
call fdderivs(ex,betax,gxxx,gxyx,gxzx,gyyx,gyzx,gzzx,&
|
call fdderivs(ex,betax,gxxx,gxyx,gxzx,gyyx,gyzx,gzzx,&
|
||||||
X,Y,Z,ANTI,SYM, SYM ,Symmetry,Lev)
|
X,Y,Z,ANTI,SYM, SYM ,Symmetry,Lev)
|
||||||
@@ -321,38 +359,54 @@
|
|||||||
call fdderivs(ex,betaz,gxxz,gxyz,gxzz,gyyz,gyzz,gzzz,&
|
call fdderivs(ex,betaz,gxxz,gxyz,gxzz,gyyz,gyzz,gzzz,&
|
||||||
X,Y,Z,SYM ,SYM, ANTI,Symmetry,Lev)
|
X,Y,Z,SYM ,SYM, ANTI,Symmetry,Lev)
|
||||||
|
|
||||||
fxx = gxxx + gxyy + gxzz
|
call fderivs(ex,Gamx,Gamxx,Gamxy,Gamxz,X,Y,Z,ANTI,SYM ,SYM ,Symmetry,Lev)
|
||||||
fxy = gxyx + gyyy + gyzz
|
call fderivs(ex,Gamy,Gamyx,Gamyy,Gamyz,X,Y,Z,SYM ,ANTI,SYM ,Symmetry,Lev)
|
||||||
fxz = gxzx + gyzy + gzzz
|
call fderivs(ex,Gamz,Gamzx,Gamzy,Gamzz,X,Y,Z,SYM ,SYM ,ANTI,Symmetry,Lev)
|
||||||
|
do k=1,ex(3)
|
||||||
Gamxa = gupxx * Gamxxx + gupyy * Gamxyy + gupzz * Gamxzz + &
|
do j=1,ex(2)
|
||||||
TWO*( gupxy * Gamxxy + gupxz * Gamxxz + gupyz * Gamxyz )
|
do i=1,ex(1)
|
||||||
Gamya = gupxx * Gamyxx + gupyy * Gamyyy + gupzz * Gamyzz + &
|
divb_loc = div_beta(i,j,k)
|
||||||
TWO*( gupxy * Gamyxy + gupxz * Gamyxz + gupyz * Gamyyz )
|
fxx_loc = gxxx(i,j,k) + gxyy(i,j,k) + gxzz(i,j,k)
|
||||||
Gamza = gupxx * Gamzxx + gupyy * Gamzyy + gupzz * Gamzzz + &
|
fxy_loc = gxyx(i,j,k) + gyyy(i,j,k) + gyzz(i,j,k)
|
||||||
TWO*( gupxy * Gamzxy + gupxz * Gamzxz + gupyz * Gamzyz )
|
fxz_loc = gxzx(i,j,k) + gyzy(i,j,k) + gzzz(i,j,k)
|
||||||
|
|
||||||
call fderivs(ex,Gamx,Gamxx,Gamxy,Gamxz,X,Y,Z,ANTI,SYM ,SYM ,Symmetry,Lev)
|
gupxx_loc = gupxx(i,j,k)
|
||||||
call fderivs(ex,Gamy,Gamyx,Gamyy,Gamyz,X,Y,Z,SYM ,ANTI,SYM ,Symmetry,Lev)
|
gupxy_loc = gupxy(i,j,k)
|
||||||
call fderivs(ex,Gamz,Gamzx,Gamzy,Gamzz,X,Y,Z,SYM ,SYM ,ANTI,Symmetry,Lev)
|
gupxz_loc = gupxz(i,j,k)
|
||||||
|
gupyy_loc = gupyy(i,j,k)
|
||||||
Gamx_rhs = Gamx_rhs + F2o3 * Gamxa * div_beta - &
|
gupyz_loc = gupyz(i,j,k)
|
||||||
Gamxa * betaxx - Gamya * betaxy - Gamza * betaxz + &
|
gupzz_loc = gupzz(i,j,k)
|
||||||
F1o3 * (gupxx * fxx + gupxy * fxy + gupxz * fxz ) + &
|
|
||||||
gupxx * gxxx + gupyy * gyyx + gupzz * gzzx + &
|
Gamxa_loc = gupxx_loc * Gamxxx(i,j,k) + gupyy_loc * Gamxyy(i,j,k) + gupzz_loc * Gamxzz(i,j,k) + &
|
||||||
TWO * (gupxy * gxyx + gupxz * gxzx + gupyz * gyzx )
|
TWO * (gupxy_loc * Gamxxy(i,j,k) + gupxz_loc * Gamxxz(i,j,k) + gupyz_loc * Gamxyz(i,j,k))
|
||||||
|
Gamya_loc = gupxx_loc * Gamyxx(i,j,k) + gupyy_loc * Gamyyy(i,j,k) + gupzz_loc * Gamyzz(i,j,k) + &
|
||||||
Gamy_rhs = Gamy_rhs + F2o3 * Gamya * div_beta - &
|
TWO * (gupxy_loc * Gamyxy(i,j,k) + gupxz_loc * Gamyxz(i,j,k) + gupyz_loc * Gamyyz(i,j,k))
|
||||||
Gamxa * betayx - Gamya * betayy - Gamza * betayz + &
|
Gamza_loc = gupxx_loc * Gamzxx(i,j,k) + gupyy_loc * Gamzyy(i,j,k) + gupzz_loc * Gamzzz(i,j,k) + &
|
||||||
F1o3 * (gupxy * fxx + gupyy * fxy + gupyz * fxz ) + &
|
TWO * (gupxy_loc * Gamzxy(i,j,k) + gupxz_loc * Gamzxz(i,j,k) + gupyz_loc * Gamzyz(i,j,k))
|
||||||
gupxx * gxxy + gupyy * gyyy + gupzz * gzzy + &
|
Gamxa(i,j,k) = Gamxa_loc
|
||||||
TWO * (gupxy * gxyy + gupxz * gxzy + gupyz * gyzy )
|
Gamya(i,j,k) = Gamya_loc
|
||||||
|
Gamza(i,j,k) = Gamza_loc
|
||||||
Gamz_rhs = Gamz_rhs + F2o3 * Gamza * div_beta - &
|
|
||||||
Gamxa * betazx - Gamya * betazy - Gamza * betazz + &
|
Gamx_rhs(i,j,k) = Gamx_rhs(i,j,k) + F2o3 * Gamxa_loc * divb_loc - &
|
||||||
F1o3 * (gupxz * fxx + gupyz * fxy + gupzz * fxz ) + &
|
Gamxa_loc * betaxx(i,j,k) - Gamya_loc * betaxy(i,j,k) - Gamza_loc * betaxz(i,j,k) + &
|
||||||
gupxx * gxxz + gupyy * gyyz + gupzz * gzzz + &
|
F1o3 * (gupxx_loc * fxx_loc + gupxy_loc * fxy_loc + gupxz_loc * fxz_loc) + &
|
||||||
TWO * (gupxy * gxyz + gupxz * gxzz + gupyz * gyzz ) !rhs for Gam^i
|
gupxx_loc * gxxx(i,j,k) + gupyy_loc * gyyx(i,j,k) + gupzz_loc * gzzx(i,j,k) + &
|
||||||
|
TWO * (gupxy_loc * gxyx(i,j,k) + gupxz_loc * gxzx(i,j,k) + gupyz_loc * gyzx(i,j,k))
|
||||||
|
|
||||||
|
Gamy_rhs(i,j,k) = Gamy_rhs(i,j,k) + F2o3 * Gamya_loc * divb_loc - &
|
||||||
|
Gamxa_loc * betayx(i,j,k) - Gamya_loc * betayy(i,j,k) - Gamza_loc * betayz(i,j,k) + &
|
||||||
|
F1o3 * (gupxy_loc * fxx_loc + gupyy_loc * fxy_loc + gupyz_loc * fxz_loc) + &
|
||||||
|
gupxx_loc * gxxy(i,j,k) + gupyy_loc * gyyy(i,j,k) + gupzz_loc * gzzy(i,j,k) + &
|
||||||
|
TWO * (gupxy_loc * gxyy(i,j,k) + gupxz_loc * gxzy(i,j,k) + gupyz_loc * gyzy(i,j,k))
|
||||||
|
|
||||||
|
Gamz_rhs(i,j,k) = Gamz_rhs(i,j,k) + F2o3 * Gamza_loc * divb_loc - &
|
||||||
|
Gamxa_loc * betazx(i,j,k) - Gamya_loc * betazy(i,j,k) - Gamza_loc * betazz(i,j,k) + &
|
||||||
|
F1o3 * (gupxz_loc * fxx_loc + gupyz_loc * fxy_loc + gupzz_loc * fxz_loc) + &
|
||||||
|
gupxx_loc * gxxz(i,j,k) + gupyy_loc * gyyz(i,j,k) + gupzz_loc * gzzz(i,j,k) + &
|
||||||
|
TWO * (gupxy_loc * gxyz(i,j,k) + gupxz_loc * gxzz(i,j,k) + gupyz_loc * gyzz(i,j,k))
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
|
||||||
!first kind of connection stored in gij,k
|
!first kind of connection stored in gij,k
|
||||||
gxxx = gxx * Gamxxx + gxy * Gamyxx + gxz * Gamzxx
|
gxxx = gxx * Gamxxx + gxy * Gamyxx + gxz * Gamzxx
|
||||||
@@ -601,192 +655,190 @@
|
|||||||
Gamxyz * gxzz + Gamyyz * gyzz + Gamzyz * gzzz + &
|
Gamxyz * gxzz + Gamyyz * gyzz + Gamzyz * gzzz + &
|
||||||
Gamxzz * gxzy + Gamyzz * gyzy + Gamzzz * gzzy + &
|
Gamxzz * gxzy + Gamyzz * gyzy + Gamzzz * gzzy + &
|
||||||
Gamxyz * gzzx + Gamyyz * gzzy + Gamzyz * gzzz )
|
Gamxyz * gzzx + Gamyyz * gzzy + Gamzyz * gzzz )
|
||||||
!covariant second derivative of chi respect to tilted metric
|
!covariant second derivative of chi respect to tilted metric
|
||||||
call fdderivs(ex,chi,fxx,fxy,fxz,fyy,fyz,fzz,X,Y,Z,SYM,SYM,SYM,Symmetry,Lev)
|
call fdderivs(ex,chi,fxx,fxy,fxz,fyy,fyz,fzz,X,Y,Z,SYM,SYM,SYM,Symmetry,Lev)
|
||||||
|
|
||||||
fxx = fxx - Gamxxx * chix - Gamyxx * chiy - Gamzxx * chiz
|
do k=1,ex(3)
|
||||||
fxy = fxy - Gamxxy * chix - Gamyxy * chiy - Gamzxy * chiz
|
do j=1,ex(2)
|
||||||
fxz = fxz - Gamxxz * chix - Gamyxz * chiy - Gamzxz * chiz
|
do i=1,ex(1)
|
||||||
fyy = fyy - Gamxyy * chix - Gamyyy * chiy - Gamzyy * chiz
|
fxx(i,j,k) = fxx(i,j,k) - Gamxxx(i,j,k) * chix(i,j,k) - Gamyxx(i,j,k) * chiy(i,j,k) - Gamzxx(i,j,k) * chiz(i,j,k)
|
||||||
fyz = fyz - Gamxyz * chix - Gamyyz * chiy - Gamzyz * chiz
|
fxy(i,j,k) = fxy(i,j,k) - Gamxxy(i,j,k) * chix(i,j,k) - Gamyxy(i,j,k) * chiy(i,j,k) - Gamzxy(i,j,k) * chiz(i,j,k)
|
||||||
fzz = fzz - Gamxzz * chix - Gamyzz * chiy - Gamzzz * chiz
|
fxz(i,j,k) = fxz(i,j,k) - Gamxxz(i,j,k) * chix(i,j,k) - Gamyxz(i,j,k) * chiy(i,j,k) - Gamzxz(i,j,k) * chiz(i,j,k)
|
||||||
! Store D^l D_l chi - 3/(2*chi) D^l chi D_l chi in f
|
fyy(i,j,k) = fyy(i,j,k) - Gamxyy(i,j,k) * chix(i,j,k) - Gamyyy(i,j,k) * chiy(i,j,k) - Gamzyy(i,j,k) * chiz(i,j,k)
|
||||||
|
fyz(i,j,k) = fyz(i,j,k) - Gamxyz(i,j,k) * chix(i,j,k) - Gamyyz(i,j,k) * chiy(i,j,k) - Gamzyz(i,j,k) * chiz(i,j,k)
|
||||||
f = gupxx * ( fxx - F3o2/chin1 * chix * chix ) + &
|
fzz(i,j,k) = fzz(i,j,k) - Gamxzz(i,j,k) * chix(i,j,k) - Gamyzz(i,j,k) * chiy(i,j,k) - Gamzzz(i,j,k) * chiz(i,j,k)
|
||||||
gupyy * ( fyy - F3o2/chin1 * chiy * chiy ) + &
|
|
||||||
gupzz * ( fzz - F3o2/chin1 * chiz * chiz ) + &
|
chin_loc = chin1(i,j,k)
|
||||||
TWO * gupxy * ( fxy - F3o2/chin1 * chix * chiy ) + &
|
f_loc = gupxx(i,j,k) * (fxx(i,j,k) - F3o2/chin_loc * chix(i,j,k) * chix(i,j,k)) + &
|
||||||
TWO * gupxz * ( fxz - F3o2/chin1 * chix * chiz ) + &
|
gupyy(i,j,k) * (fyy(i,j,k) - F3o2/chin_loc * chiy(i,j,k) * chiy(i,j,k)) + &
|
||||||
TWO * gupyz * ( fyz - F3o2/chin1 * chiy * chiz )
|
gupzz(i,j,k) * (fzz(i,j,k) - F3o2/chin_loc * chiz(i,j,k) * chiz(i,j,k)) + &
|
||||||
! Add chi part to Ricci tensor:
|
TWO * gupxy(i,j,k) * (fxy(i,j,k) - F3o2/chin_loc * chix(i,j,k) * chiy(i,j,k)) + &
|
||||||
|
TWO * gupxz(i,j,k) * (fxz(i,j,k) - F3o2/chin_loc * chix(i,j,k) * chiz(i,j,k)) + &
|
||||||
Rxx = Rxx + (fxx - chix*chix/chin1/TWO + gxx * f)/chin1/TWO
|
TWO * gupyz(i,j,k) * (fyz(i,j,k) - F3o2/chin_loc * chiy(i,j,k) * chiz(i,j,k))
|
||||||
Ryy = Ryy + (fyy - chiy*chiy/chin1/TWO + gyy * f)/chin1/TWO
|
f(i,j,k) = f_loc
|
||||||
Rzz = Rzz + (fzz - chiz*chiz/chin1/TWO + gzz * f)/chin1/TWO
|
|
||||||
Rxy = Rxy + (fxy - chix*chiy/chin1/TWO + gxy * f)/chin1/TWO
|
Rxx(i,j,k) = Rxx(i,j,k) + (fxx(i,j,k) - chix(i,j,k)*chix(i,j,k)/chin_loc/TWO + gxx(i,j,k) * f_loc)/chin_loc/TWO
|
||||||
Rxz = Rxz + (fxz - chix*chiz/chin1/TWO + gxz * f)/chin1/TWO
|
Ryy(i,j,k) = Ryy(i,j,k) + (fyy(i,j,k) - chiy(i,j,k)*chiy(i,j,k)/chin_loc/TWO + gyy(i,j,k) * f_loc)/chin_loc/TWO
|
||||||
Ryz = Ryz + (fyz - chiy*chiz/chin1/TWO + gyz * f)/chin1/TWO
|
Rzz(i,j,k) = Rzz(i,j,k) + (fzz(i,j,k) - chiz(i,j,k)*chiz(i,j,k)/chin_loc/TWO + gzz(i,j,k) * f_loc)/chin_loc/TWO
|
||||||
|
Rxy(i,j,k) = Rxy(i,j,k) + (fxy(i,j,k) - chix(i,j,k)*chiy(i,j,k)/chin_loc/TWO + gxy(i,j,k) * f_loc)/chin_loc/TWO
|
||||||
! covariant second derivatives of the lapse respect to physical metric
|
Rxz(i,j,k) = Rxz(i,j,k) + (fxz(i,j,k) - chix(i,j,k)*chiz(i,j,k)/chin_loc/TWO + gxz(i,j,k) * f_loc)/chin_loc/TWO
|
||||||
call fdderivs(ex,Lap,fxx,fxy,fxz,fyy,fyz,fzz,X,Y,Z, &
|
Ryz(i,j,k) = Ryz(i,j,k) + (fyz(i,j,k) - chiy(i,j,k)*chiz(i,j,k)/chin_loc/TWO + gyz(i,j,k) * f_loc)/chin_loc/TWO
|
||||||
SYM,SYM,SYM,symmetry,Lev)
|
enddo
|
||||||
|
enddo
|
||||||
gxxx = (gupxx * chix + gupxy * chiy + gupxz * chiz)/chin1
|
enddo
|
||||||
gxxy = (gupxy * chix + gupyy * chiy + gupyz * chiz)/chin1
|
|
||||||
gxxz = (gupxz * chix + gupyz * chiy + gupzz * chiz)/chin1
|
! covariant second derivatives of the lapse respect to physical metric
|
||||||
! now get physical second kind of connection
|
call fdderivs(ex,Lap,fxx,fxy,fxz,fyy,fyz,fzz,X,Y,Z, &
|
||||||
Gamxxx = Gamxxx - ( (chix + chix)/chin1 - gxx * gxxx )*HALF
|
SYM,SYM,SYM,symmetry,Lev)
|
||||||
Gamyxx = Gamyxx - ( - gxx * gxxy )*HALF
|
|
||||||
Gamzxx = Gamzxx - ( - gxx * gxxz )*HALF
|
do k=1,ex(3)
|
||||||
Gamxyy = Gamxyy - ( - gyy * gxxx )*HALF
|
do j=1,ex(2)
|
||||||
Gamyyy = Gamyyy - ( (chiy + chiy)/chin1 - gyy * gxxy )*HALF
|
do i=1,ex(1)
|
||||||
Gamzyy = Gamzyy - ( - gyy * gxxz )*HALF
|
chin_loc = chin1(i,j,k)
|
||||||
Gamxzz = Gamxzz - ( - gzz * gxxx )*HALF
|
gxxx(i,j,k) = (gupxx(i,j,k) * chix(i,j,k) + gupxy(i,j,k) * chiy(i,j,k) + gupxz(i,j,k) * chiz(i,j,k)) / chin_loc
|
||||||
Gamyzz = Gamyzz - ( - gzz * gxxy )*HALF
|
gxxy(i,j,k) = (gupxy(i,j,k) * chix(i,j,k) + gupyy(i,j,k) * chiy(i,j,k) + gupyz(i,j,k) * chiz(i,j,k)) / chin_loc
|
||||||
Gamzzz = Gamzzz - ( (chiz + chiz)/chin1 - gzz * gxxz )*HALF
|
gxxz(i,j,k) = (gupxz(i,j,k) * chix(i,j,k) + gupyz(i,j,k) * chiy(i,j,k) + gupzz(i,j,k) * chiz(i,j,k)) / chin_loc
|
||||||
Gamxxy = Gamxxy - ( chiy /chin1 - gxy * gxxx )*HALF
|
|
||||||
Gamyxy = Gamyxy - ( chix /chin1 - gxy * gxxy )*HALF
|
Gamxxx(i,j,k) = Gamxxx(i,j,k) - ( (chix(i,j,k) + chix(i,j,k))/chin_loc - gxx(i,j,k) * gxxx(i,j,k) )*HALF
|
||||||
Gamzxy = Gamzxy - ( - gxy * gxxz )*HALF
|
Gamyxx(i,j,k) = Gamyxx(i,j,k) - ( - gxx(i,j,k) * gxxy(i,j,k) )*HALF
|
||||||
Gamxxz = Gamxxz - ( chiz /chin1 - gxz * gxxx )*HALF
|
Gamzxx(i,j,k) = Gamzxx(i,j,k) - ( - gxx(i,j,k) * gxxz(i,j,k) )*HALF
|
||||||
Gamyxz = Gamyxz - ( - gxz * gxxy )*HALF
|
Gamxyy(i,j,k) = Gamxyy(i,j,k) - ( - gyy(i,j,k) * gxxx(i,j,k) )*HALF
|
||||||
Gamzxz = Gamzxz - ( chix /chin1 - gxz * gxxz )*HALF
|
Gamyyy(i,j,k) = Gamyyy(i,j,k) - ( (chiy(i,j,k) + chiy(i,j,k))/chin_loc - gyy(i,j,k) * gxxy(i,j,k) )*HALF
|
||||||
Gamxyz = Gamxyz - ( - gyz * gxxx )*HALF
|
Gamzyy(i,j,k) = Gamzyy(i,j,k) - ( - gyy(i,j,k) * gxxz(i,j,k) )*HALF
|
||||||
Gamyyz = Gamyyz - ( chiz /chin1 - gyz * gxxy )*HALF
|
Gamxzz(i,j,k) = Gamxzz(i,j,k) - ( - gzz(i,j,k) * gxxx(i,j,k) )*HALF
|
||||||
Gamzyz = Gamzyz - ( chiy /chin1 - gyz * gxxz )*HALF
|
Gamyzz(i,j,k) = Gamyzz(i,j,k) - ( - gzz(i,j,k) * gxxy(i,j,k) )*HALF
|
||||||
|
Gamzzz(i,j,k) = Gamzzz(i,j,k) - ( (chiz(i,j,k) + chiz(i,j,k))/chin_loc - gzz(i,j,k) * gxxz(i,j,k) )*HALF
|
||||||
fxx = fxx - Gamxxx*Lapx - Gamyxx*Lapy - Gamzxx*Lapz
|
Gamxxy(i,j,k) = Gamxxy(i,j,k) - ( chiy(i,j,k) /chin_loc - gxy(i,j,k) * gxxx(i,j,k) )*HALF
|
||||||
fyy = fyy - Gamxyy*Lapx - Gamyyy*Lapy - Gamzyy*Lapz
|
Gamyxy(i,j,k) = Gamyxy(i,j,k) - ( chix(i,j,k) /chin_loc - gxy(i,j,k) * gxxy(i,j,k) )*HALF
|
||||||
fzz = fzz - Gamxzz*Lapx - Gamyzz*Lapy - Gamzzz*Lapz
|
Gamzxy(i,j,k) = Gamzxy(i,j,k) - ( - gxy(i,j,k) * gxxz(i,j,k) )*HALF
|
||||||
fxy = fxy - Gamxxy*Lapx - Gamyxy*Lapy - Gamzxy*Lapz
|
Gamxxz(i,j,k) = Gamxxz(i,j,k) - ( chiz(i,j,k) /chin_loc - gxz(i,j,k) * gxxx(i,j,k) )*HALF
|
||||||
fxz = fxz - Gamxxz*Lapx - Gamyxz*Lapy - Gamzxz*Lapz
|
Gamyxz(i,j,k) = Gamyxz(i,j,k) - ( - gxz(i,j,k) * gxxy(i,j,k) )*HALF
|
||||||
fyz = fyz - Gamxyz*Lapx - Gamyyz*Lapy - Gamzyz*Lapz
|
Gamzxz(i,j,k) = Gamzxz(i,j,k) - ( chix(i,j,k) /chin_loc - gxz(i,j,k) * gxxz(i,j,k) )*HALF
|
||||||
|
Gamxyz(i,j,k) = Gamxyz(i,j,k) - ( - gyz(i,j,k) * gxxx(i,j,k) )*HALF
|
||||||
! store D^i D_i Lap in trK_rhs upto chi
|
Gamyyz(i,j,k) = Gamyyz(i,j,k) - ( chiz(i,j,k) /chin_loc - gyz(i,j,k) * gxxy(i,j,k) )*HALF
|
||||||
trK_rhs = gupxx * fxx + gupyy * fyy + gupzz * fzz + &
|
Gamzyz(i,j,k) = Gamzyz(i,j,k) - ( chiy(i,j,k) /chin_loc - gyz(i,j,k) * gxxz(i,j,k) )*HALF
|
||||||
TWO* ( gupxy * fxy + gupxz * fxz + gupyz * fyz )
|
|
||||||
#if 1
|
fxx(i,j,k) = fxx(i,j,k) - Gamxxx(i,j,k)*Lapx(i,j,k) - Gamyxx(i,j,k)*Lapy(i,j,k) - Gamzxx(i,j,k)*Lapz(i,j,k)
|
||||||
!! follow bam code
|
fyy(i,j,k) = fyy(i,j,k) - Gamxyy(i,j,k)*Lapx(i,j,k) - Gamyyy(i,j,k)*Lapy(i,j,k) - Gamzyy(i,j,k)*Lapz(i,j,k)
|
||||||
S = chin1 * ( gupxx * Sxx + gupyy * Syy + gupzz * Szz + &
|
fzz(i,j,k) = fzz(i,j,k) - Gamxzz(i,j,k)*Lapx(i,j,k) - Gamyzz(i,j,k)*Lapy(i,j,k) - Gamzzz(i,j,k)*Lapz(i,j,k)
|
||||||
TWO * ( gupxy * Sxy + gupxz * Sxz + gupyz * Syz ) )
|
fxy(i,j,k) = fxy(i,j,k) - Gamxxy(i,j,k)*Lapx(i,j,k) - Gamyxy(i,j,k)*Lapy(i,j,k) - Gamzxy(i,j,k)*Lapz(i,j,k)
|
||||||
f = F2o3 * trK * trK -(&
|
fxz(i,j,k) = fxz(i,j,k) - Gamxxz(i,j,k)*Lapx(i,j,k) - Gamyxz(i,j,k)*Lapy(i,j,k) - Gamzxz(i,j,k)*Lapz(i,j,k)
|
||||||
gupxx * ( &
|
fyz(i,j,k) = fyz(i,j,k) - Gamxyz(i,j,k)*Lapx(i,j,k) - Gamyyz(i,j,k)*Lapy(i,j,k) - Gamzyz(i,j,k)*Lapz(i,j,k)
|
||||||
gupxx * Axx * Axx + gupyy * Axy * Axy + gupzz * Axz * Axz + &
|
|
||||||
TWO * (gupxy * Axx * Axy + gupxz * Axx * Axz + gupyz * Axy * Axz) ) + &
|
trK_rhs(i,j,k) = gupxx(i,j,k) * fxx(i,j,k) + gupyy(i,j,k) * fyy(i,j,k) + gupzz(i,j,k) * fzz(i,j,k) + &
|
||||||
gupyy * ( &
|
TWO * (gupxy(i,j,k) * fxy(i,j,k) + gupxz(i,j,k) * fxz(i,j,k) + gupyz(i,j,k) * fyz(i,j,k))
|
||||||
gupxx * Axy * Axy + gupyy * Ayy * Ayy + gupzz * Ayz * Ayz + &
|
enddo
|
||||||
TWO * (gupxy * Axy * Ayy + gupxz * Axy * Ayz + gupyz * Ayy * Ayz) ) + &
|
enddo
|
||||||
gupzz * ( &
|
enddo
|
||||||
gupxx * Axz * Axz + gupyy * Ayz * Ayz + gupzz * Azz * Azz + &
|
do k=1,ex(3)
|
||||||
TWO * (gupxy * Axz * Ayz + gupxz * Axz * Azz + gupyz * Ayz * Azz) ) + &
|
do j=1,ex(2)
|
||||||
TWO * ( &
|
do i=1,ex(1)
|
||||||
gupxy * ( &
|
divb_loc = div_beta(i,j,k)
|
||||||
gupxx * Axx * Axy + gupyy * Axy * Ayy + gupzz * Axz * Ayz + &
|
chin_loc = chin1(i,j,k)
|
||||||
gupxy * (Axx * Ayy + Axy * Axy) + &
|
|
||||||
gupxz * (Axx * Ayz + Axz * Axy) + &
|
S_loc = chin_loc * ( gupxx(i,j,k) * Sxx(i,j,k) + gupyy(i,j,k) * Syy(i,j,k) + gupzz(i,j,k) * Szz(i,j,k) + &
|
||||||
gupyz * (Axy * Ayz + Axz * Ayy) ) + &
|
TWO * (gupxy(i,j,k) * Sxy(i,j,k) + gupxz(i,j,k) * Sxz(i,j,k) + gupyz(i,j,k) * Syz(i,j,k)) )
|
||||||
gupxz * ( &
|
S(i,j,k) = S_loc
|
||||||
gupxx * Axx * Axz + gupyy * Axy * Ayz + gupzz * Axz * Azz + &
|
|
||||||
gupxy * (Axx * Ayz + Axy * Axz) + &
|
f_loc = F2o3 * trK(i,j,k) * trK(i,j,k) - ( &
|
||||||
gupxz * (Axx * Azz + Axz * Axz) + &
|
gupxx(i,j,k) * ( gupxx(i,j,k) * Axx(i,j,k) * Axx(i,j,k) + gupyy(i,j,k) * Axy(i,j,k) * Axy(i,j,k) + &
|
||||||
gupyz * (Axy * Azz + Axz * Ayz) ) + &
|
gupzz(i,j,k) * Axz(i,j,k) * Axz(i,j,k) + &
|
||||||
gupyz * ( &
|
TWO * (gupxy(i,j,k) * Axx(i,j,k) * Axy(i,j,k) + gupxz(i,j,k) * Axx(i,j,k) * Axz(i,j,k) + &
|
||||||
gupxx * Axy * Axz + gupyy * Ayy * Ayz + gupzz * Ayz * Azz + &
|
gupyz(i,j,k) * Axy(i,j,k) * Axz(i,j,k)) ) + &
|
||||||
gupxy * (Axy * Ayz + Ayy * Axz) + &
|
gupyy(i,j,k) * ( gupxx(i,j,k) * Axy(i,j,k) * Axy(i,j,k) + gupyy(i,j,k) * Ayy(i,j,k) * Ayy(i,j,k) + &
|
||||||
gupxz * (Axy * Azz + Ayz * Axz) + &
|
gupzz(i,j,k) * Ayz(i,j,k) * Ayz(i,j,k) + &
|
||||||
gupyz * (Ayy * Azz + Ayz * Ayz) ) )) -1.6d1*PI*rho + EIGHT * PI * S
|
TWO * (gupxy(i,j,k) * Axy(i,j,k) * Ayy(i,j,k) + gupxz(i,j,k) * Axy(i,j,k) * Ayz(i,j,k) + &
|
||||||
f = - F1o3 *( gupxx * fxx + gupyy * fyy + gupzz * fzz + &
|
gupyz(i,j,k) * Ayy(i,j,k) * Ayz(i,j,k)) ) + &
|
||||||
TWO* ( gupxy * fxy + gupxz * fxz + gupyz * fyz ) + alpn1/chin1*f)
|
gupzz(i,j,k) * ( gupxx(i,j,k) * Axz(i,j,k) * Axz(i,j,k) + gupyy(i,j,k) * Ayz(i,j,k) * Ayz(i,j,k) + &
|
||||||
|
gupzz(i,j,k) * Azz(i,j,k) * Azz(i,j,k) + &
|
||||||
fxx = alpn1 * (Rxx - EIGHT * PI * Sxx) - fxx
|
TWO * (gupxy(i,j,k) * Axz(i,j,k) * Ayz(i,j,k) + gupxz(i,j,k) * Axz(i,j,k) * Azz(i,j,k) + &
|
||||||
fxy = alpn1 * (Rxy - EIGHT * PI * Sxy) - fxy
|
gupyz(i,j,k) * Ayz(i,j,k) * Azz(i,j,k)) ) + &
|
||||||
fxz = alpn1 * (Rxz - EIGHT * PI * Sxz) - fxz
|
TWO * ( gupxy(i,j,k) * ( gupxx(i,j,k) * Axx(i,j,k) * Axy(i,j,k) + gupyy(i,j,k) * Axy(i,j,k) * Ayy(i,j,k) + &
|
||||||
fyy = alpn1 * (Ryy - EIGHT * PI * Syy) - fyy
|
gupzz(i,j,k) * Axz(i,j,k) * Ayz(i,j,k) + &
|
||||||
fyz = alpn1 * (Ryz - EIGHT * PI * Syz) - fyz
|
gupxy(i,j,k) * (Axx(i,j,k) * Ayy(i,j,k) + Axy(i,j,k) * Axy(i,j,k)) + &
|
||||||
fzz = alpn1 * (Rzz - EIGHT * PI * Szz) - fzz
|
gupxz(i,j,k) * (Axx(i,j,k) * Ayz(i,j,k) + Axz(i,j,k) * Axy(i,j,k)) + &
|
||||||
#else
|
gupyz(i,j,k) * (Axy(i,j,k) * Ayz(i,j,k) + Axz(i,j,k) * Ayy(i,j,k)) ) + &
|
||||||
! Add lapse and S_ij parts to Ricci tensor:
|
gupxz(i,j,k) * ( gupxx(i,j,k) * Axx(i,j,k) * Axz(i,j,k) + gupyy(i,j,k) * Axy(i,j,k) * Ayz(i,j,k) + &
|
||||||
|
gupzz(i,j,k) * Axz(i,j,k) * Azz(i,j,k) + &
|
||||||
fxx = alpn1 * (Rxx - EIGHT * PI * Sxx) - fxx
|
gupxy(i,j,k) * (Axx(i,j,k) * Ayz(i,j,k) + Axy(i,j,k) * Axz(i,j,k)) + &
|
||||||
fxy = alpn1 * (Rxy - EIGHT * PI * Sxy) - fxy
|
gupxz(i,j,k) * (Axx(i,j,k) * Azz(i,j,k) + Axz(i,j,k) * Axz(i,j,k)) + &
|
||||||
fxz = alpn1 * (Rxz - EIGHT * PI * Sxz) - fxz
|
gupyz(i,j,k) * (Axy(i,j,k) * Azz(i,j,k) + Axz(i,j,k) * Ayz(i,j,k)) ) + &
|
||||||
fyy = alpn1 * (Ryy - EIGHT * PI * Syy) - fyy
|
gupyz(i,j,k) * ( gupxx(i,j,k) * Axy(i,j,k) * Axz(i,j,k) + gupyy(i,j,k) * Ayy(i,j,k) * Ayz(i,j,k) + &
|
||||||
fyz = alpn1 * (Ryz - EIGHT * PI * Syz) - fyz
|
gupzz(i,j,k) * Ayz(i,j,k) * Azz(i,j,k) + &
|
||||||
fzz = alpn1 * (Rzz - EIGHT * PI * Szz) - fzz
|
gupxy(i,j,k) * (Axy(i,j,k) * Ayz(i,j,k) + Ayy(i,j,k) * Axz(i,j,k)) + &
|
||||||
|
gupxz(i,j,k) * (Axy(i,j,k) * Azz(i,j,k) + Ayz(i,j,k) * Axz(i,j,k)) + &
|
||||||
! Compute trace-free part (note: chi^-1 and chi cancel!):
|
gupyz(i,j,k) * (Ayy(i,j,k) * Azz(i,j,k) + Ayz(i,j,k) * Ayz(i,j,k)) ) ) ) - &
|
||||||
|
F16 * PI * rho(i,j,k) + EIGHT * PI * S_loc
|
||||||
f = F1o3 *( gupxx * fxx + gupyy * fyy + gupzz * fzz + &
|
|
||||||
TWO* ( gupxy * fxy + gupxz * fxz + gupyz * fyz ) )
|
f_loc = -F1o3 * ( gupxx(i,j,k) * fxx(i,j,k) + gupyy(i,j,k) * fyy(i,j,k) + gupzz(i,j,k) * fzz(i,j,k) + &
|
||||||
#endif
|
TWO * (gupxy(i,j,k) * fxy(i,j,k) + gupxz(i,j,k) * fxz(i,j,k) + gupyz(i,j,k) * fyz(i,j,k)) + &
|
||||||
|
alpn1(i,j,k)/chin_loc * f_loc )
|
||||||
Axx_rhs = fxx - gxx * f
|
f(i,j,k) = f_loc
|
||||||
Ayy_rhs = fyy - gyy * f
|
|
||||||
Azz_rhs = fzz - gzz * f
|
l_fxx = alpn1(i,j,k) * (Rxx(i,j,k) - EIGHT * PI * Sxx(i,j,k)) - fxx(i,j,k)
|
||||||
Axy_rhs = fxy - gxy * f
|
l_fxy = alpn1(i,j,k) * (Rxy(i,j,k) - EIGHT * PI * Sxy(i,j,k)) - fxy(i,j,k)
|
||||||
Axz_rhs = fxz - gxz * f
|
l_fxz = alpn1(i,j,k) * (Rxz(i,j,k) - EIGHT * PI * Sxz(i,j,k)) - fxz(i,j,k)
|
||||||
Ayz_rhs = fyz - gyz * f
|
l_fyy = alpn1(i,j,k) * (Ryy(i,j,k) - EIGHT * PI * Syy(i,j,k)) - fyy(i,j,k)
|
||||||
|
l_fyz = alpn1(i,j,k) * (Ryz(i,j,k) - EIGHT * PI * Syz(i,j,k)) - fyz(i,j,k)
|
||||||
! Now: store A_il A^l_j into fij:
|
l_fzz = alpn1(i,j,k) * (Rzz(i,j,k) - EIGHT * PI * Szz(i,j,k)) - fzz(i,j,k)
|
||||||
|
|
||||||
fxx = gupxx * Axx * Axx + gupyy * Axy * Axy + gupzz * Axz * Axz + &
|
Axx_rhs(i,j,k) = l_fxx - gxx(i,j,k) * f_loc
|
||||||
TWO * (gupxy * Axx * Axy + gupxz * Axx * Axz + gupyz * Axy * Axz)
|
Ayy_rhs(i,j,k) = l_fyy - gyy(i,j,k) * f_loc
|
||||||
fyy = gupxx * Axy * Axy + gupyy * Ayy * Ayy + gupzz * Ayz * Ayz + &
|
Azz_rhs(i,j,k) = l_fzz - gzz(i,j,k) * f_loc
|
||||||
TWO * (gupxy * Axy * Ayy + gupxz * Axy * Ayz + gupyz * Ayy * Ayz)
|
Axy_rhs(i,j,k) = l_fxy - gxy(i,j,k) * f_loc
|
||||||
fzz = gupxx * Axz * Axz + gupyy * Ayz * Ayz + gupzz * Azz * Azz + &
|
Axz_rhs(i,j,k) = l_fxz - gxz(i,j,k) * f_loc
|
||||||
TWO * (gupxy * Axz * Ayz + gupxz * Axz * Azz + gupyz * Ayz * Azz)
|
Ayz_rhs(i,j,k) = l_fyz - gyz(i,j,k) * f_loc
|
||||||
fxy = gupxx * Axx * Axy + gupyy * Axy * Ayy + gupzz * Axz * Ayz + &
|
|
||||||
gupxy *(Axx * Ayy + Axy * Axy) + &
|
fxx(i,j,k) = gupxx(i,j,k) * Axx(i,j,k) * Axx(i,j,k) + gupyy(i,j,k) * Axy(i,j,k) * Axy(i,j,k) + &
|
||||||
gupxz *(Axx * Ayz + Axz * Axy) + &
|
gupzz(i,j,k) * Axz(i,j,k) * Axz(i,j,k) + TWO * (gupxy(i,j,k) * Axx(i,j,k) * Axy(i,j,k) + &
|
||||||
gupyz *(Axy * Ayz + Axz * Ayy)
|
gupxz(i,j,k) * Axx(i,j,k) * Axz(i,j,k) + gupyz(i,j,k) * Axy(i,j,k) * Axz(i,j,k))
|
||||||
fxz = gupxx * Axx * Axz + gupyy * Axy * Ayz + gupzz * Axz * Azz + &
|
fyy(i,j,k) = gupxx(i,j,k) * Axy(i,j,k) * Axy(i,j,k) + gupyy(i,j,k) * Ayy(i,j,k) * Ayy(i,j,k) + &
|
||||||
gupxy *(Axx * Ayz + Axy * Axz) + &
|
gupzz(i,j,k) * Ayz(i,j,k) * Ayz(i,j,k) + TWO * (gupxy(i,j,k) * Axy(i,j,k) * Ayy(i,j,k) + &
|
||||||
gupxz *(Axx * Azz + Axz * Axz) + &
|
gupxz(i,j,k) * Axy(i,j,k) * Ayz(i,j,k) + gupyz(i,j,k) * Ayy(i,j,k) * Ayz(i,j,k))
|
||||||
gupyz *(Axy * Azz + Axz * Ayz)
|
fzz(i,j,k) = gupxx(i,j,k) * Axz(i,j,k) * Axz(i,j,k) + gupyy(i,j,k) * Ayz(i,j,k) * Ayz(i,j,k) + &
|
||||||
fyz = gupxx * Axy * Axz + gupyy * Ayy * Ayz + gupzz * Ayz * Azz + &
|
gupzz(i,j,k) * Azz(i,j,k) * Azz(i,j,k) + TWO * (gupxy(i,j,k) * Axz(i,j,k) * Ayz(i,j,k) + &
|
||||||
gupxy *(Axy * Ayz + Ayy * Axz) + &
|
gupxz(i,j,k) * Axz(i,j,k) * Azz(i,j,k) + gupyz(i,j,k) * Ayz(i,j,k) * Azz(i,j,k))
|
||||||
gupxz *(Axy * Azz + Ayz * Axz) + &
|
fxy(i,j,k) = gupxx(i,j,k) * Axx(i,j,k) * Axy(i,j,k) + gupyy(i,j,k) * Axy(i,j,k) * Ayy(i,j,k) + &
|
||||||
gupyz *(Ayy * Azz + Ayz * Ayz)
|
gupzz(i,j,k) * Axz(i,j,k) * Ayz(i,j,k) + gupxy(i,j,k) * (Axx(i,j,k) * Ayy(i,j,k) + Axy(i,j,k) * Axy(i,j,k)) + &
|
||||||
|
gupxz(i,j,k) * (Axx(i,j,k) * Ayz(i,j,k) + Axz(i,j,k) * Axy(i,j,k)) + &
|
||||||
f = chin1
|
gupyz(i,j,k) * (Axy(i,j,k) * Ayz(i,j,k) + Axz(i,j,k) * Ayy(i,j,k))
|
||||||
! store D^i D_i Lap in trK_rhs
|
fxz(i,j,k) = gupxx(i,j,k) * Axx(i,j,k) * Axz(i,j,k) + gupyy(i,j,k) * Axy(i,j,k) * Ayz(i,j,k) + &
|
||||||
trK_rhs = f*trK_rhs
|
gupzz(i,j,k) * Axz(i,j,k) * Azz(i,j,k) + gupxy(i,j,k) * (Axx(i,j,k) * Ayz(i,j,k) + Axy(i,j,k) * Axz(i,j,k)) + &
|
||||||
|
gupxz(i,j,k) * (Axx(i,j,k) * Azz(i,j,k) + Axz(i,j,k) * Axz(i,j,k)) + &
|
||||||
Axx_rhs = f * Axx_rhs+ alpn1 * (trK * Axx - TWO * fxx) + &
|
gupyz(i,j,k) * (Axy(i,j,k) * Azz(i,j,k) + Axz(i,j,k) * Ayz(i,j,k))
|
||||||
TWO * ( Axx * betaxx + Axy * betayx + Axz * betazx )- &
|
fyz(i,j,k) = gupxx(i,j,k) * Axy(i,j,k) * Axz(i,j,k) + gupyy(i,j,k) * Ayy(i,j,k) * Ayz(i,j,k) + &
|
||||||
F2o3 * Axx * div_beta
|
gupzz(i,j,k) * Ayz(i,j,k) * Azz(i,j,k) + gupxy(i,j,k) * (Axy(i,j,k) * Ayz(i,j,k) + Ayy(i,j,k) * Axz(i,j,k)) + &
|
||||||
|
gupxz(i,j,k) * (Axy(i,j,k) * Azz(i,j,k) + Ayz(i,j,k) * Axz(i,j,k)) + &
|
||||||
Ayy_rhs = f * Ayy_rhs+ alpn1 * (trK * Ayy - TWO * fyy) + &
|
gupyz(i,j,k) * (Ayy(i,j,k) * Azz(i,j,k) + Ayz(i,j,k) * Ayz(i,j,k))
|
||||||
TWO * ( Axy * betaxy + Ayy * betayy + Ayz * betazy )- &
|
|
||||||
F2o3 * Ayy * div_beta
|
trK_rhs(i,j,k) = chin_loc * trK_rhs(i,j,k)
|
||||||
|
|
||||||
Azz_rhs = f * Azz_rhs+ alpn1 * (trK * Azz - TWO * fzz) + &
|
Axx_rhs(i,j,k) = chin_loc * Axx_rhs(i,j,k) + alpn1(i,j,k) * (trK(i,j,k) * Axx(i,j,k) - TWO * fxx(i,j,k)) + &
|
||||||
TWO * ( Axz * betaxz + Ayz * betayz + Azz * betazz )- &
|
TWO * (Axx(i,j,k) * betaxx(i,j,k) + Axy(i,j,k) * betayx(i,j,k) + Axz(i,j,k) * betazx(i,j,k)) - &
|
||||||
F2o3 * Azz * div_beta
|
F2o3 * Axx(i,j,k) * divb_loc
|
||||||
|
Ayy_rhs(i,j,k) = chin_loc * Ayy_rhs(i,j,k) + alpn1(i,j,k) * (trK(i,j,k) * Ayy(i,j,k) - TWO * fyy(i,j,k)) + &
|
||||||
Axy_rhs = f * Axy_rhs+ alpn1 *( trK * Axy - TWO * fxy )+ &
|
TWO * (Axy(i,j,k) * betaxy(i,j,k) + Ayy(i,j,k) * betayy(i,j,k) + Ayz(i,j,k) * betazy(i,j,k)) - &
|
||||||
Axx * betaxy + Axz * betazy + &
|
F2o3 * Ayy(i,j,k) * divb_loc
|
||||||
Ayy * betayx + Ayz * betazx + &
|
Azz_rhs(i,j,k) = chin_loc * Azz_rhs(i,j,k) + alpn1(i,j,k) * (trK(i,j,k) * Azz(i,j,k) - TWO * fzz(i,j,k)) + &
|
||||||
F1o3 * Axy * div_beta - Axy * betazz
|
TWO * (Axz(i,j,k) * betaxz(i,j,k) + Ayz(i,j,k) * betayz(i,j,k) + Azz(i,j,k) * betazz(i,j,k)) - &
|
||||||
|
F2o3 * Azz(i,j,k) * divb_loc
|
||||||
Ayz_rhs = f * Ayz_rhs+ alpn1 *( trK * Ayz - TWO * fyz )+ &
|
Axy_rhs(i,j,k) = chin_loc * Axy_rhs(i,j,k) + alpn1(i,j,k) * (trK(i,j,k) * Axy(i,j,k) - TWO * fxy(i,j,k)) + &
|
||||||
Axy * betaxz + Ayy * betayz + &
|
Axx(i,j,k) * betaxy(i,j,k) + Axz(i,j,k) * betazy(i,j,k) + Ayy(i,j,k) * betayx(i,j,k) + &
|
||||||
Axz * betaxy + Azz * betazy + &
|
Ayz(i,j,k) * betazx(i,j,k) + F1o3 * Axy(i,j,k) * divb_loc - Axy(i,j,k) * betazz(i,j,k)
|
||||||
F1o3 * Ayz * div_beta - Ayz * betaxx
|
Ayz_rhs(i,j,k) = chin_loc * Ayz_rhs(i,j,k) + alpn1(i,j,k) * (trK(i,j,k) * Ayz(i,j,k) - TWO * fyz(i,j,k)) + &
|
||||||
|
Axy(i,j,k) * betaxz(i,j,k) + Ayy(i,j,k) * betayz(i,j,k) + Axz(i,j,k) * betaxy(i,j,k) + &
|
||||||
Axz_rhs = f * Axz_rhs+ alpn1 *( trK * Axz - TWO * fxz )+ &
|
Azz(i,j,k) * betazy(i,j,k) + F1o3 * Ayz(i,j,k) * divb_loc - Ayz(i,j,k) * betaxx(i,j,k)
|
||||||
Axx * betaxz + Axy * betayz + &
|
Axz_rhs(i,j,k) = chin_loc * Axz_rhs(i,j,k) + alpn1(i,j,k) * (trK(i,j,k) * Axz(i,j,k) - TWO * fxz(i,j,k)) + &
|
||||||
Ayz * betayx + Azz * betazx + &
|
Axx(i,j,k) * betaxz(i,j,k) + Axy(i,j,k) * betayz(i,j,k) + Ayz(i,j,k) * betayx(i,j,k) + &
|
||||||
F1o3 * Axz * div_beta - Axz * betayy !rhs for Aij
|
Azz(i,j,k) * betazx(i,j,k) + F1o3 * Axz(i,j,k) * divb_loc - Axz(i,j,k) * betayy(i,j,k)
|
||||||
|
|
||||||
! Compute trace of S_ij
|
trK_rhs(i,j,k) = - trK_rhs(i,j,k) + alpn1(i,j,k) * ( F1o3 * trK(i,j,k) * trK(i,j,k) + &
|
||||||
|
gupxx(i,j,k) * fxx(i,j,k) + gupyy(i,j,k) * fyy(i,j,k) + gupzz(i,j,k) * fzz(i,j,k) + &
|
||||||
S = f * ( gupxx * Sxx + gupyy * Syy + gupzz * Szz + &
|
TWO * (gupxy(i,j,k) * fxy(i,j,k) + gupxz(i,j,k) * fxz(i,j,k) + gupyz(i,j,k) * fyz(i,j,k)) + &
|
||||||
TWO * ( gupxy * Sxy + gupxz * Sxz + gupyz * Syz ) )
|
FOUR * PI * (rho(i,j,k) + S_loc) )
|
||||||
|
enddo
|
||||||
trK_rhs = - trK_rhs + alpn1 *( F1o3 * trK * trK + &
|
enddo
|
||||||
gupxx * fxx + gupyy * fyy + gupzz * fzz + &
|
enddo
|
||||||
TWO * ( gupxy * fxy + gupxz * fxz + gupyz * fyz ) + &
|
|
||||||
FOUR * PI * ( rho + S )) !rhs for trK
|
|
||||||
|
|
||||||
!!!! gauge variable part
|
!!!! gauge variable part
|
||||||
|
|
||||||
@@ -948,15 +1000,15 @@
|
|||||||
!!!!!!!!!advection term + Kreiss-Oliger dissipation (merged for cache efficiency)
|
!!!!!!!!!advection term + Kreiss-Oliger dissipation (merged for cache efficiency)
|
||||||
! lopsided_kodis shares the symmetry_bd buffer between advection and
|
! lopsided_kodis shares the symmetry_bd buffer between advection and
|
||||||
! dissipation, eliminating redundant full-grid copies. For metric variables
|
! dissipation, eliminating redundant full-grid copies. For metric variables
|
||||||
! gxx/gyy/gzz (=dxx/dyy/dzz+1): kodis stencil coefficients sum to zero,
|
! gxx/gyy/gzz (=dxx/dyy/dzz+1): stencil coefficients sum to zero,
|
||||||
! so the constant offset has no effect on dissipation.
|
! so the constant offset has no effect on dissipation.
|
||||||
|
|
||||||
call lopsided_kodis(ex,X,Y,Z,gxx,gxx_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
call lopsided_kodis(ex,X,Y,Z,dxx,gxx_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
||||||
call lopsided_kodis(ex,X,Y,Z,gxy,gxy_rhs,betax,betay,betaz,Symmetry,AAS,eps)
|
call lopsided_kodis(ex,X,Y,Z,gxy,gxy_rhs,betax,betay,betaz,Symmetry,AAS,eps)
|
||||||
call lopsided_kodis(ex,X,Y,Z,gxz,gxz_rhs,betax,betay,betaz,Symmetry,ASA,eps)
|
call lopsided_kodis(ex,X,Y,Z,gxz,gxz_rhs,betax,betay,betaz,Symmetry,ASA,eps)
|
||||||
call lopsided_kodis(ex,X,Y,Z,gyy,gyy_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
call lopsided_kodis(ex,X,Y,Z,dyy,gyy_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
||||||
call lopsided_kodis(ex,X,Y,Z,gyz,gyz_rhs,betax,betay,betaz,Symmetry,SAA,eps)
|
call lopsided_kodis(ex,X,Y,Z,gyz,gyz_rhs,betax,betay,betaz,Symmetry,SAA,eps)
|
||||||
call lopsided_kodis(ex,X,Y,Z,gzz,gzz_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
call lopsided_kodis(ex,X,Y,Z,dzz,gzz_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
||||||
|
|
||||||
call lopsided_kodis(ex,X,Y,Z,Axx,Axx_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
call lopsided_kodis(ex,X,Y,Z,Axx,Axx_rhs,betax,betay,betaz,Symmetry,SSS,eps)
|
||||||
call lopsided_kodis(ex,X,Y,Z,Axy,Axy_rhs,betax,betay,betaz,Symmetry,AAS,eps)
|
call lopsided_kodis(ex,X,Y,Z,Axy,Axy_rhs,betax,betay,betaz,Symmetry,AAS,eps)
|
||||||
|
|||||||
@@ -22,19 +22,32 @@
|
|||||||
#define f_compute_rhs_Z4c_ss COMPUTE_RHS_Z4C_SS
|
#define f_compute_rhs_Z4c_ss COMPUTE_RHS_Z4C_SS
|
||||||
#define f_compute_constraint_fr COMPUTE_CONSTRAINT_FR
|
#define f_compute_constraint_fr COMPUTE_CONSTRAINT_FR
|
||||||
#endif
|
#endif
|
||||||
#ifdef fortran3
|
#ifdef fortran3
|
||||||
#define f_compute_rhs_bssn compute_rhs_bssn_
|
#define f_compute_rhs_bssn compute_rhs_bssn_
|
||||||
#define f_compute_rhs_bssn_ss compute_rhs_bssn_ss_
|
#define f_compute_rhs_bssn_ss compute_rhs_bssn_ss_
|
||||||
#define f_compute_rhs_bssn_escalar compute_rhs_bssn_escalar_
|
#define f_compute_rhs_bssn_escalar compute_rhs_bssn_escalar_
|
||||||
#define f_compute_rhs_bssn_escalar_ss compute_rhs_bssn_escalar_ss_
|
#define f_compute_rhs_bssn_escalar_ss compute_rhs_bssn_escalar_ss_
|
||||||
#define f_compute_rhs_Z4c compute_rhs_z4c_
|
#define f_compute_rhs_Z4c compute_rhs_z4c_
|
||||||
#define f_compute_rhs_Z4cnot compute_rhs_z4cnot_
|
#define f_compute_rhs_Z4cnot compute_rhs_z4cnot_
|
||||||
#define f_compute_rhs_Z4c_ss compute_rhs_z4c_ss_
|
#define f_compute_rhs_Z4c_ss compute_rhs_z4c_ss_
|
||||||
#define f_compute_constraint_fr compute_constraint_fr_
|
#define f_compute_constraint_fr compute_constraint_fr_
|
||||||
#endif
|
#endif
|
||||||
extern "C"
|
|
||||||
{
|
#ifdef __cplusplus
|
||||||
int f_compute_rhs_bssn(int *, double &, double *, double *, double *, // ex,T,X,Y,Z
|
extern "C"
|
||||||
|
{
|
||||||
|
#endif
|
||||||
|
void f_bssn_rhs_kernel_timing_reset();
|
||||||
|
int f_bssn_rhs_kernel_timing_bucket_count();
|
||||||
|
const double *f_bssn_rhs_kernel_timing_local_seconds();
|
||||||
|
const char *f_bssn_rhs_kernel_timing_label(int);
|
||||||
|
#ifdef __cplusplus
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
|
||||||
|
extern "C"
|
||||||
|
{
|
||||||
|
int f_compute_rhs_bssn(int *, double &, double *, double *, double *, // ex,T,X,Y,Z
|
||||||
double *, double *, // chi, trK
|
double *, double *, // chi, trK
|
||||||
double *, double *, double *, double *, double *, double *, // gij
|
double *, double *, double *, double *, double *, double *, // gij
|
||||||
double *, double *, double *, double *, double *, double *, // Aij
|
double *, double *, double *, double *, double *, double *, // Aij
|
||||||
@@ -50,13 +63,34 @@ extern "C"
|
|||||||
double *, double *, double *, double *, double *, double *, // Christoffel
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
double *, double *, double *, double *, double *, double *, // Christoffel
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
double *, double *, double *, double *, double *, double *, // Ricci
|
double *, double *, double *, double *, double *, double *, // Ricci
|
||||||
double *, double *, double *, double *, double *, double *, double *, // constraint violation
|
double *, double *, double *, double *, double *, double *, double *, // constraint violation
|
||||||
int &, int &, double &, int &);
|
int &, int &, double &, int &);
|
||||||
}
|
}
|
||||||
|
|
||||||
extern "C"
|
int f_compute_rhs_bssn_escalar_c(int *, double &, double *, double *, double *, // ex,T,X,Y,Z
|
||||||
{
|
double *, double *, // chi, trK
|
||||||
int f_compute_rhs_bssn_ss(int *, double &, double *, double *, double *, // ex,T,rho,sigma,R
|
double *, double *, double *, double *, double *, double *, // gij
|
||||||
|
double *, double *, double *, double *, double *, double *, // Aij
|
||||||
|
double *, double *, double *, // Gam
|
||||||
|
double *, double *, double *, double *, double *, double *, double *, // Gauge
|
||||||
|
double *, double *, // Sphi, Spi
|
||||||
|
double *, double *, // chi, trK
|
||||||
|
double *, double *, double *, double *, double *, double *, // gij
|
||||||
|
double *, double *, double *, double *, double *, double *, // Aij
|
||||||
|
double *, double *, double *, // Gam
|
||||||
|
double *, double *, double *, double *, double *, double *, double *, // Gauge
|
||||||
|
double *, double *, // Sphi, Spi
|
||||||
|
double *, double *, double *, double *, double *, double *, double *, double *, double *, double *, // stress-energy
|
||||||
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
|
double *, double *, double *, double *, double *, double *, // Ricci
|
||||||
|
double *, double *, double *, double *, double *, double *, double *, // constraint violation
|
||||||
|
int &, int &, double &, int &);
|
||||||
|
|
||||||
|
extern "C"
|
||||||
|
{
|
||||||
|
int f_compute_rhs_bssn_ss(int *, double &, double *, double *, double *, // ex,T,rho,sigma,R
|
||||||
double *, double *, double *, // X,Y,Z
|
double *, double *, double *, // X,Y,Z
|
||||||
double *, double *, double *, // drhodx,drhody,drhodz
|
double *, double *, double *, // drhodx,drhody,drhodz
|
||||||
double *, double *, double *, // dsigmadx,dsigmady,dsigmadz
|
double *, double *, double *, // dsigmadx,dsigmady,dsigmadz
|
||||||
@@ -83,10 +117,10 @@ extern "C"
|
|||||||
int &, int &, double &, int &, int &);
|
int &, int &, double &, int &, int &);
|
||||||
}
|
}
|
||||||
|
|
||||||
extern "C"
|
extern "C"
|
||||||
{
|
{
|
||||||
int f_compute_rhs_bssn_escalar(int *, double &, double *, double *, double *, // ex,T,X,Y,Z
|
int f_compute_rhs_bssn_escalar(int *, double &, double *, double *, double *, // ex,T,X,Y,Z
|
||||||
double *, double *, // chi, trK
|
double *, double *, // chi, trK
|
||||||
double *, double *, double *, double *, double *, double *, // gij
|
double *, double *, double *, double *, double *, double *, // gij
|
||||||
double *, double *, double *, double *, double *, double *, // Aij
|
double *, double *, double *, double *, double *, double *, // Aij
|
||||||
double *, double *, double *, // Gam
|
double *, double *, double *, // Gam
|
||||||
@@ -103,14 +137,14 @@ extern "C"
|
|||||||
double *, double *, double *, double *, double *, double *, // Christoffel
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
double *, double *, double *, double *, double *, double *, // Christoffel
|
double *, double *, double *, double *, double *, double *, // Christoffel
|
||||||
double *, double *, double *, double *, double *, double *, // Ricci
|
double *, double *, double *, double *, double *, double *, // Ricci
|
||||||
double *, double *, double *, double *, double *, double *, double *, // constraint violation
|
double *, double *, double *, double *, double *, double *, double *, // constraint violation
|
||||||
int &, int &, double &, int &);
|
int &, int &, double &, int &);
|
||||||
}
|
}
|
||||||
|
|
||||||
extern "C"
|
extern "C"
|
||||||
{
|
{
|
||||||
int f_compute_rhs_bssn_escalar_ss(int *, double &, double *, double *, double *, // ex,T,rho,sigma,R
|
int f_compute_rhs_bssn_escalar_ss(int *, double &, double *, double *, double *, // ex,T,rho,sigma,R
|
||||||
double *, double *, double *, // X,Y,Z
|
double *, double *, double *, // X,Y,Z
|
||||||
double *, double *, double *, // drhodx,drhody,drhodz
|
double *, double *, double *, // drhodx,drhody,drhodz
|
||||||
double *, double *, double *, // dsigmadx,dsigmady,dsigmadz
|
double *, double *, double *, // dsigmadx,dsigmady,dsigmadz
|
||||||
double *, double *, double *, // dRdx,dRdy,dRdz
|
double *, double *, double *, // dRdx,dRdy,dRdz
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
@@ -33,7 +33,7 @@
|
|||||||
real*8 :: dX,dY,dZ
|
real*8 :: dX,dY,dZ
|
||||||
real*8,dimension(0:ex(1),0:ex(2),0:ex(3)) :: fh
|
real*8,dimension(0:ex(1),0:ex(2),0:ex(3)) :: fh
|
||||||
real*8, dimension(3) :: SoA
|
real*8, dimension(3) :: SoA
|
||||||
integer :: imin,jmin,kmin,imax,jmax,kmax,i,j,k
|
integer :: imin,jmin,kmin,imax,jmax,kmax,i,j,k
|
||||||
real*8 :: d2dx,d2dy,d2dz
|
real*8 :: d2dx,d2dy,d2dz
|
||||||
integer, parameter :: NO_SYMM = 0, EQ_SYMM = 1, OCTANT = 2
|
integer, parameter :: NO_SYMM = 0, EQ_SYMM = 1, OCTANT = 2
|
||||||
real*8, parameter :: ZEO=0.d0,ONE=1.d0, F60=6.d1
|
real*8, parameter :: ZEO=0.d0,ONE=1.d0, F60=6.d1
|
||||||
@@ -137,7 +137,7 @@
|
|||||||
real*8 :: dX
|
real*8 :: dX
|
||||||
real*8,dimension(0:ex(1),0:ex(2),0:ex(3)) :: fh
|
real*8,dimension(0:ex(1),0:ex(2),0:ex(3)) :: fh
|
||||||
real*8, dimension(3) :: SoA
|
real*8, dimension(3) :: SoA
|
||||||
integer :: imin,jmin,kmin,imax,jmax,kmax,i,j,k
|
integer :: imin,jmin,kmin,imax,jmax,kmax,i,j,k
|
||||||
real*8 :: d2dx
|
real*8 :: d2dx
|
||||||
integer, parameter :: NO_SYMM = 0, EQ_SYMM = 1, OCTANT = 2
|
integer, parameter :: NO_SYMM = 0, EQ_SYMM = 1, OCTANT = 2
|
||||||
real*8, parameter :: ZEO=0.d0,ONE=1.d0, F60=6.d1
|
real*8, parameter :: ZEO=0.d0,ONE=1.d0, F60=6.d1
|
||||||
@@ -1512,8 +1512,9 @@
|
|||||||
real*8 :: dX,dY,dZ
|
real*8 :: dX,dY,dZ
|
||||||
real*8,dimension(-1:ex(1),-1:ex(2),-1:ex(3)) :: fh
|
real*8,dimension(-1:ex(1),-1:ex(2),-1:ex(3)) :: fh
|
||||||
real*8, dimension(3) :: SoA
|
real*8, dimension(3) :: SoA
|
||||||
integer :: imin,jmin,kmin,imax,jmax,kmax,i,j,k
|
integer :: imin,jmin,kmin,imax,jmax,kmax,i,j,k
|
||||||
real*8 :: Sdxdx,Sdydy,Sdzdz,Fdxdx,Fdydy,Fdzdz
|
integer :: i_core_min,i_core_max,j_core_min,j_core_max,k_core_min,k_core_max
|
||||||
|
real*8 :: Sdxdx,Sdydy,Sdzdz,Fdxdx,Fdydy,Fdzdz
|
||||||
real*8 :: Sdxdy,Sdxdz,Sdydz,Fdxdy,Fdxdz,Fdydz
|
real*8 :: Sdxdy,Sdxdz,Sdydz,Fdxdy,Fdxdz,Fdydz
|
||||||
integer, parameter :: NO_SYMM = 0, EQ_SYMM = 1, OCTANT = 2
|
integer, parameter :: NO_SYMM = 0, EQ_SYMM = 1, OCTANT = 2
|
||||||
real*8, parameter :: ZEO=0.d0, ONE=1.d0, TWO=2.d0, F1o4=2.5d-1, F9=9.d0, F45=4.5d1
|
real*8, parameter :: ZEO=0.d0, ONE=1.d0, TWO=2.d0, F1o4=2.5d-1, F9=9.d0, F45=4.5d1
|
||||||
@@ -1560,17 +1561,55 @@
|
|||||||
|
|
||||||
fxx = ZEO
|
fxx = ZEO
|
||||||
fyy = ZEO
|
fyy = ZEO
|
||||||
fzz = ZEO
|
fzz = ZEO
|
||||||
fxy = ZEO
|
fxy = ZEO
|
||||||
fxz = ZEO
|
fxz = ZEO
|
||||||
fyz = ZEO
|
fyz = ZEO
|
||||||
|
|
||||||
do k=1,ex(3)
|
i_core_min = max(1, imin+2)
|
||||||
do j=1,ex(2)
|
i_core_max = min(ex(1), imax-2)
|
||||||
do i=1,ex(1)
|
j_core_min = max(1, jmin+2)
|
||||||
!~~~~~~ fxx
|
j_core_max = min(ex(2), jmax-2)
|
||||||
if(i+2 <= imax .and. i-2 >= imin)then
|
k_core_min = max(1, kmin+2)
|
||||||
!
|
k_core_max = min(ex(3), kmax-2)
|
||||||
|
|
||||||
|
if(i_core_min <= i_core_max .and. j_core_min <= j_core_max .and. k_core_min <= k_core_max)then
|
||||||
|
do k=k_core_min,k_core_max
|
||||||
|
do j=j_core_min,j_core_max
|
||||||
|
do i=i_core_min,i_core_max
|
||||||
|
! interior points always use 4th-order stencils without branch checks
|
||||||
|
fxx(i,j,k) = Fdxdx*(-fh(i-2,j,k)+F16*fh(i-1,j,k)-F30*fh(i,j,k) &
|
||||||
|
-fh(i+2,j,k)+F16*fh(i+1,j,k) )
|
||||||
|
fyy(i,j,k) = Fdydy*(-fh(i,j-2,k)+F16*fh(i,j-1,k)-F30*fh(i,j,k) &
|
||||||
|
-fh(i,j+2,k)+F16*fh(i,j+1,k) )
|
||||||
|
fzz(i,j,k) = Fdzdz*(-fh(i,j,k-2)+F16*fh(i,j,k-1)-F30*fh(i,j,k) &
|
||||||
|
-fh(i,j,k+2)+F16*fh(i,j,k+1) )
|
||||||
|
fxy(i,j,k) = Fdxdy*( (fh(i-2,j-2,k)-F8*fh(i-1,j-2,k)+F8*fh(i+1,j-2,k)-fh(i+2,j-2,k)) &
|
||||||
|
-F8 *(fh(i-2,j-1,k)-F8*fh(i-1,j-1,k)+F8*fh(i+1,j-1,k)-fh(i+2,j-1,k)) &
|
||||||
|
+F8 *(fh(i-2,j+1,k)-F8*fh(i-1,j+1,k)+F8*fh(i+1,j+1,k)-fh(i+2,j+1,k)) &
|
||||||
|
- (fh(i-2,j+2,k)-F8*fh(i-1,j+2,k)+F8*fh(i+1,j+2,k)-fh(i+2,j+2,k)))
|
||||||
|
fxz(i,j,k) = Fdxdz*( (fh(i-2,j,k-2)-F8*fh(i-1,j,k-2)+F8*fh(i+1,j,k-2)-fh(i+2,j,k-2)) &
|
||||||
|
-F8 *(fh(i-2,j,k-1)-F8*fh(i-1,j,k-1)+F8*fh(i+1,j,k-1)-fh(i+2,j,k-1)) &
|
||||||
|
+F8 *(fh(i-2,j,k+1)-F8*fh(i-1,j,k+1)+F8*fh(i+1,j,k+1)-fh(i+2,j,k+1)) &
|
||||||
|
- (fh(i-2,j,k+2)-F8*fh(i-1,j,k+2)+F8*fh(i+1,j,k+2)-fh(i+2,j,k+2)))
|
||||||
|
fyz(i,j,k) = Fdydz*( (fh(i,j-2,k-2)-F8*fh(i,j-1,k-2)+F8*fh(i,j+1,k-2)-fh(i,j+2,k-2)) &
|
||||||
|
-F8 *(fh(i,j-2,k-1)-F8*fh(i,j-1,k-1)+F8*fh(i,j+1,k-1)-fh(i,j+2,k-1)) &
|
||||||
|
+F8 *(fh(i,j-2,k+1)-F8*fh(i,j-1,k+1)+F8*fh(i,j+1,k+1)-fh(i,j+2,k+1)) &
|
||||||
|
- (fh(i,j-2,k+2)-F8*fh(i,j-1,k+2)+F8*fh(i,j+1,k+2)-fh(i,j+2,k+2)))
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
endif
|
||||||
|
|
||||||
|
do k=1,ex(3)
|
||||||
|
do j=1,ex(2)
|
||||||
|
do i=1,ex(1)
|
||||||
|
if(i>=i_core_min .and. i<=i_core_max .and. &
|
||||||
|
j>=j_core_min .and. j<=j_core_max .and. &
|
||||||
|
k>=k_core_min .and. k<=k_core_max) cycle
|
||||||
|
!~~~~~~ fxx
|
||||||
|
if(i+2 <= imax .and. i-2 >= imin)then
|
||||||
|
!
|
||||||
! - f(i-2) + 16 f(i-1) - 30 f(i) + 16 f(i+1) - f(i+2)
|
! - f(i-2) + 16 f(i-1) - 30 f(i) + 16 f(i+1) - f(i+2)
|
||||||
! fxx(i) = ----------------------------------------------------------
|
! fxx(i) = ----------------------------------------------------------
|
||||||
! 12 dx^2
|
! 12 dx^2
|
||||||
|
|||||||
@@ -71,149 +71,99 @@ void fdderivs(const int ex[3],
|
|||||||
const double Fdxdz = F1o144 / (dX * dZ);
|
const double Fdxdz = F1o144 / (dX * dZ);
|
||||||
const double Fdydz = F1o144 / (dY * dZ);
|
const double Fdydz = F1o144 / (dY * dZ);
|
||||||
|
|
||||||
/* 输出清零:fxx,fyy,fzz,fxy,fxz,fyz = 0 */
|
/* 只清零不被主循环覆盖的边界面 */
|
||||||
const size_t all = (size_t)ex1 * (size_t)ex2 * (size_t)ex3;
|
{
|
||||||
for (size_t p = 0; p < all; ++p) {
|
/* 高边界:k0=ex3-1 */
|
||||||
fxx[p] = ZEO; fyy[p] = ZEO; fzz[p] = ZEO;
|
for (int j0 = 0; j0 < ex2; ++j0)
|
||||||
fxy[p] = ZEO; fxz[p] = ZEO; fyz[p] = ZEO;
|
for (int i0 = 0; i0 < ex1; ++i0) {
|
||||||
|
const size_t p = idx_ex(i0, j0, ex3 - 1, ex);
|
||||||
|
fxx[p]=ZEO; fyy[p]=ZEO; fzz[p]=ZEO;
|
||||||
|
fxy[p]=ZEO; fxz[p]=ZEO; fyz[p]=ZEO;
|
||||||
|
}
|
||||||
|
/* 高边界:j0=ex2-1 */
|
||||||
|
for (int k0 = 0; k0 < ex3 - 1; ++k0)
|
||||||
|
for (int i0 = 0; i0 < ex1; ++i0) {
|
||||||
|
const size_t p = idx_ex(i0, ex2 - 1, k0, ex);
|
||||||
|
fxx[p]=ZEO; fyy[p]=ZEO; fzz[p]=ZEO;
|
||||||
|
fxy[p]=ZEO; fxz[p]=ZEO; fyz[p]=ZEO;
|
||||||
|
}
|
||||||
|
/* 高边界:i0=ex1-1 */
|
||||||
|
for (int k0 = 0; k0 < ex3 - 1; ++k0)
|
||||||
|
for (int j0 = 0; j0 < ex2 - 1; ++j0) {
|
||||||
|
const size_t p = idx_ex(ex1 - 1, j0, k0, ex);
|
||||||
|
fxx[p]=ZEO; fyy[p]=ZEO; fzz[p]=ZEO;
|
||||||
|
fxy[p]=ZEO; fxz[p]=ZEO; fyz[p]=ZEO;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 低边界:当二阶模板也不可用时,对应 i0/j0/k0=0 面 */
|
||||||
|
if (kminF == 1) {
|
||||||
|
for (int j0 = 0; j0 < ex2; ++j0)
|
||||||
|
for (int i0 = 0; i0 < ex1; ++i0) {
|
||||||
|
const size_t p = idx_ex(i0, j0, 0, ex);
|
||||||
|
fxx[p]=ZEO; fyy[p]=ZEO; fzz[p]=ZEO;
|
||||||
|
fxy[p]=ZEO; fxz[p]=ZEO; fyz[p]=ZEO;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (jminF == 1) {
|
||||||
|
for (int k0 = 0; k0 < ex3; ++k0)
|
||||||
|
for (int i0 = 0; i0 < ex1; ++i0) {
|
||||||
|
const size_t p = idx_ex(i0, 0, k0, ex);
|
||||||
|
fxx[p]=ZEO; fyy[p]=ZEO; fzz[p]=ZEO;
|
||||||
|
fxy[p]=ZEO; fxz[p]=ZEO; fyz[p]=ZEO;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (iminF == 1) {
|
||||||
|
for (int k0 = 0; k0 < ex3; ++k0)
|
||||||
|
for (int j0 = 0; j0 < ex2; ++j0) {
|
||||||
|
const size_t p = idx_ex(0, j0, k0, ex);
|
||||||
|
fxx[p]=ZEO; fyy[p]=ZEO; fzz[p]=ZEO;
|
||||||
|
fxy[p]=ZEO; fxz[p]=ZEO; fyz[p]=ZEO;
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Fortran:
|
* 两段式:
|
||||||
* do k=1,ex3-1
|
* 1) 二阶可用区域先计算二阶模板
|
||||||
* do j=1,ex2-1
|
* 2) 高阶可用区域再覆盖四阶模板
|
||||||
* do i=1,ex1-1
|
|
||||||
*/
|
*/
|
||||||
|
const int i2_lo = (iminF > 0) ? iminF : 0;
|
||||||
for (int k0 = 0; k0 <= ex3 - 2; ++k0) {
|
const int j2_lo = (jminF > 0) ? jminF : 0;
|
||||||
const int kF = k0 + 1;
|
const int k2_lo = (kminF > 0) ? kminF : 0;
|
||||||
for (int j0 = 0; j0 <= ex2 - 2; ++j0) {
|
const int i2_hi = ex1 - 2;
|
||||||
const int jF = j0 + 1;
|
const int j2_hi = ex2 - 2;
|
||||||
for (int i0 = 0; i0 <= ex1 - 2; ++i0) {
|
const int k2_hi = ex3 - 2;
|
||||||
const int iF = i0 + 1;
|
|
||||||
const size_t p = idx_ex(i0, j0, k0, ex);
|
|
||||||
|
|
||||||
/* 高阶分支:i±2,j±2,k±2 都在范围内 */
|
const int i4_lo = (iminF + 1 > 0) ? (iminF + 1) : 0;
|
||||||
if ((iF + 2) <= imaxF && (iF - 2) >= iminF &&
|
const int j4_lo = (jminF + 1 > 0) ? (jminF + 1) : 0;
|
||||||
(jF + 2) <= jmaxF && (jF - 2) >= jminF &&
|
const int k4_lo = (kminF + 1 > 0) ? (kminF + 1) : 0;
|
||||||
(kF + 2) <= kmaxF && (kF - 2) >= kminF)
|
const int i4_hi = ex1 - 3;
|
||||||
{
|
const int j4_hi = ex2 - 3;
|
||||||
fxx[p] = Fdxdx * (
|
const int k4_hi = ex3 - 3;
|
||||||
-fh[idx_fh_F_ord2(iF - 2, jF, kF, ex)] +
|
|
||||||
F16 * fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] -
|
|
||||||
F30 * fh[idx_fh_F_ord2(iF, jF, kF, ex)] -
|
|
||||||
fh[idx_fh_F_ord2(iF + 2, jF, kF, ex)] +
|
|
||||||
F16 * fh[idx_fh_F_ord2(iF + 1, jF, kF, ex)]
|
|
||||||
);
|
|
||||||
|
|
||||||
fyy[p] = Fdydy * (
|
/*
|
||||||
-fh[idx_fh_F_ord2(iF, jF - 2, kF, ex)] +
|
* Strategy A:
|
||||||
F16 * fh[idx_fh_F_ord2(iF, jF - 1, kF, ex)] -
|
* Avoid redundant work in overlap of 2nd/4th-order regions.
|
||||||
F30 * fh[idx_fh_F_ord2(iF, jF, kF, ex)] -
|
* Only compute 2nd-order on shell points that are NOT overwritten by
|
||||||
fh[idx_fh_F_ord2(iF, jF + 2, kF, ex)] +
|
* the 4th-order pass.
|
||||||
F16 * fh[idx_fh_F_ord2(iF, jF + 1, kF, ex)]
|
*/
|
||||||
);
|
const int has4 = (i4_lo <= i4_hi && j4_lo <= j4_hi && k4_lo <= k4_hi);
|
||||||
|
|
||||||
fzz[p] = Fdzdz * (
|
if (i2_lo <= i2_hi && j2_lo <= j2_hi && k2_lo <= k2_hi) {
|
||||||
-fh[idx_fh_F_ord2(iF, jF, kF - 2, ex)] +
|
for (int k0 = k2_lo; k0 <= k2_hi; ++k0) {
|
||||||
F16 * fh[idx_fh_F_ord2(iF, jF, kF - 1, ex)] -
|
const int kF = k0 + 1;
|
||||||
F30 * fh[idx_fh_F_ord2(iF, jF, kF, ex)] -
|
for (int j0 = j2_lo; j0 <= j2_hi; ++j0) {
|
||||||
fh[idx_fh_F_ord2(iF, jF, kF + 2, ex)] +
|
const int jF = j0 + 1;
|
||||||
F16 * fh[idx_fh_F_ord2(iF, jF, kF + 1, ex)]
|
for (int i0 = i2_lo; i0 <= i2_hi; ++i0) {
|
||||||
);
|
if (has4 &&
|
||||||
|
i0 >= i4_lo && i0 <= i4_hi &&
|
||||||
/* fxy 高阶:完全照搬 Fortran 的括号结构 */
|
j0 >= j4_lo && j0 <= j4_hi &&
|
||||||
{
|
k0 >= k4_lo && k0 <= k4_hi) {
|
||||||
const double t_jm2 =
|
continue;
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF - 2, kF, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF - 2, kF, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF - 2, kF, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF - 2, kF, ex)] );
|
|
||||||
|
|
||||||
const double t_jm1 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF - 1, kF, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF - 1, kF, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF - 1, kF, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF - 1, kF, ex)] );
|
|
||||||
|
|
||||||
const double t_jp1 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF + 1, kF, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF + 1, kF, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF + 1, kF, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF + 1, kF, ex)] );
|
|
||||||
|
|
||||||
const double t_jp2 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF + 2, kF, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF + 2, kF, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF + 2, kF, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF + 2, kF, ex)] );
|
|
||||||
|
|
||||||
fxy[p] = Fdxdy * ( t_jm2 - F8 * t_jm1 + F8 * t_jp1 - t_jp2 );
|
|
||||||
}
|
}
|
||||||
|
const int iF = i0 + 1;
|
||||||
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
/* fxz 高阶 */
|
|
||||||
{
|
|
||||||
const double t_km2 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF, kF - 2, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF - 2, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF - 2, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF, kF - 2, ex)] );
|
|
||||||
|
|
||||||
const double t_km1 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF, kF - 1, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF - 1, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF - 1, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF, kF - 1, ex)] );
|
|
||||||
|
|
||||||
const double t_kp1 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF, kF + 1, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF + 1, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF + 1, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF, kF + 1, ex)] );
|
|
||||||
|
|
||||||
const double t_kp2 =
|
|
||||||
( fh[idx_fh_F_ord2(iF - 2, jF, kF + 2, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF + 2, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF + 2, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF + 2, jF, kF + 2, ex)] );
|
|
||||||
|
|
||||||
fxz[p] = Fdxdz * ( t_km2 - F8 * t_km1 + F8 * t_kp1 - t_kp2 );
|
|
||||||
}
|
|
||||||
|
|
||||||
/* fyz 高阶 */
|
|
||||||
{
|
|
||||||
const double t_km2 =
|
|
||||||
( fh[idx_fh_F_ord2(iF, jF - 2, kF - 2, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF - 2, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF - 2, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF, jF + 2, kF - 2, ex)] );
|
|
||||||
|
|
||||||
const double t_km1 =
|
|
||||||
( fh[idx_fh_F_ord2(iF, jF - 2, kF - 1, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF - 1, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF - 1, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF, jF + 2, kF - 1, ex)] );
|
|
||||||
|
|
||||||
const double t_kp1 =
|
|
||||||
( fh[idx_fh_F_ord2(iF, jF - 2, kF + 1, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF + 1, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF + 1, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF, jF + 2, kF + 1, ex)] );
|
|
||||||
|
|
||||||
const double t_kp2 =
|
|
||||||
( fh[idx_fh_F_ord2(iF, jF - 2, kF + 2, ex)]
|
|
||||||
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF + 2, ex)]
|
|
||||||
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF + 2, ex)]
|
|
||||||
- fh[idx_fh_F_ord2(iF, jF + 2, kF + 2, ex)] );
|
|
||||||
|
|
||||||
fyz[p] = Fdydz * ( t_km2 - F8 * t_km1 + F8 * t_kp1 - t_kp2 );
|
|
||||||
}
|
|
||||||
}
|
|
||||||
/* 二阶分支:i±1,j±1,k±1 在范围内 */
|
|
||||||
else if ((iF + 1) <= imaxF && (iF - 1) >= iminF &&
|
|
||||||
(jF + 1) <= jmaxF && (jF - 1) >= jminF &&
|
|
||||||
(kF + 1) <= kmaxF && (kF - 1) >= kminF)
|
|
||||||
{
|
|
||||||
fxx[p] = Sdxdx * (
|
fxx[p] = Sdxdx * (
|
||||||
fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] -
|
fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] -
|
||||||
TWO * fh[idx_fh_F_ord2(iF, jF, kF, ex)] +
|
TWO * fh[idx_fh_F_ord2(iF, jF, kF, ex)] +
|
||||||
@@ -252,17 +202,131 @@ void fdderivs(const int ex[3],
|
|||||||
fh[idx_fh_F_ord2(iF, jF - 1, kF + 1, ex)] +
|
fh[idx_fh_F_ord2(iF, jF - 1, kF + 1, ex)] +
|
||||||
fh[idx_fh_F_ord2(iF, jF + 1, kF + 1, ex)]
|
fh[idx_fh_F_ord2(iF, jF + 1, kF + 1, ex)]
|
||||||
);
|
);
|
||||||
}else{
|
}
|
||||||
fxx[p] = 0.0;
|
}
|
||||||
fyy[p] = 0.0;
|
}
|
||||||
fzz[p] = 0.0;
|
}
|
||||||
fxy[p] = 0.0;
|
|
||||||
fxz[p] = 0.0;
|
if (has4) {
|
||||||
fyz[p] = 0.0;
|
for (int k0 = k4_lo; k0 <= k4_hi; ++k0) {
|
||||||
|
const int kF = k0 + 1;
|
||||||
|
for (int j0 = j4_lo; j0 <= j4_hi; ++j0) {
|
||||||
|
const int jF = j0 + 1;
|
||||||
|
for (int i0 = i4_lo; i0 <= i4_hi; ++i0) {
|
||||||
|
const int iF = i0 + 1;
|
||||||
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
|
fxx[p] = Fdxdx * (
|
||||||
|
-fh[idx_fh_F_ord2(iF - 2, jF, kF, ex)] +
|
||||||
|
F16 * fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] -
|
||||||
|
F30 * fh[idx_fh_F_ord2(iF, jF, kF, ex)] -
|
||||||
|
fh[idx_fh_F_ord2(iF + 2, jF, kF, ex)] +
|
||||||
|
F16 * fh[idx_fh_F_ord2(iF + 1, jF, kF, ex)]
|
||||||
|
);
|
||||||
|
|
||||||
|
fyy[p] = Fdydy * (
|
||||||
|
-fh[idx_fh_F_ord2(iF, jF - 2, kF, ex)] +
|
||||||
|
F16 * fh[idx_fh_F_ord2(iF, jF - 1, kF, ex)] -
|
||||||
|
F30 * fh[idx_fh_F_ord2(iF, jF, kF, ex)] -
|
||||||
|
fh[idx_fh_F_ord2(iF, jF + 2, kF, ex)] +
|
||||||
|
F16 * fh[idx_fh_F_ord2(iF, jF + 1, kF, ex)]
|
||||||
|
);
|
||||||
|
|
||||||
|
fzz[p] = Fdzdz * (
|
||||||
|
-fh[idx_fh_F_ord2(iF, jF, kF - 2, ex)] +
|
||||||
|
F16 * fh[idx_fh_F_ord2(iF, jF, kF - 1, ex)] -
|
||||||
|
F30 * fh[idx_fh_F_ord2(iF, jF, kF, ex)] -
|
||||||
|
fh[idx_fh_F_ord2(iF, jF, kF + 2, ex)] +
|
||||||
|
F16 * fh[idx_fh_F_ord2(iF, jF, kF + 1, ex)]
|
||||||
|
);
|
||||||
|
|
||||||
|
{
|
||||||
|
const double t_jm2 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF - 2, kF, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF - 2, kF, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF - 2, kF, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF - 2, kF, ex)] );
|
||||||
|
|
||||||
|
const double t_jm1 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF - 1, kF, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF - 1, kF, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF - 1, kF, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF - 1, kF, ex)] );
|
||||||
|
|
||||||
|
const double t_jp1 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF + 1, kF, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF + 1, kF, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF + 1, kF, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF + 1, kF, ex)] );
|
||||||
|
|
||||||
|
const double t_jp2 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF + 2, kF, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF + 2, kF, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF + 2, kF, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF + 2, kF, ex)] );
|
||||||
|
|
||||||
|
fxy[p] = Fdxdy * ( t_jm2 - F8 * t_jm1 + F8 * t_jp1 - t_jp2 );
|
||||||
|
}
|
||||||
|
|
||||||
|
{
|
||||||
|
const double t_km2 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF, kF - 2, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF - 2, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF - 2, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF, kF - 2, ex)] );
|
||||||
|
|
||||||
|
const double t_km1 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF, kF - 1, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF - 1, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF - 1, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF, kF - 1, ex)] );
|
||||||
|
|
||||||
|
const double t_kp1 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF, kF + 1, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF + 1, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF + 1, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF, kF + 1, ex)] );
|
||||||
|
|
||||||
|
const double t_kp2 =
|
||||||
|
( fh[idx_fh_F_ord2(iF - 2, jF, kF + 2, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF - 1, jF, kF + 2, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF + 1, jF, kF + 2, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF + 2, jF, kF + 2, ex)] );
|
||||||
|
|
||||||
|
fxz[p] = Fdxdz * ( t_km2 - F8 * t_km1 + F8 * t_kp1 - t_kp2 );
|
||||||
|
}
|
||||||
|
|
||||||
|
{
|
||||||
|
const double t_km2 =
|
||||||
|
( fh[idx_fh_F_ord2(iF, jF - 2, kF - 2, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF - 2, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF - 2, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF, jF + 2, kF - 2, ex)] );
|
||||||
|
|
||||||
|
const double t_km1 =
|
||||||
|
( fh[idx_fh_F_ord2(iF, jF - 2, kF - 1, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF - 1, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF - 1, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF, jF + 2, kF - 1, ex)] );
|
||||||
|
|
||||||
|
const double t_kp1 =
|
||||||
|
( fh[idx_fh_F_ord2(iF, jF - 2, kF + 1, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF + 1, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF + 1, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF, jF + 2, kF + 1, ex)] );
|
||||||
|
|
||||||
|
const double t_kp2 =
|
||||||
|
( fh[idx_fh_F_ord2(iF, jF - 2, kF + 2, ex)]
|
||||||
|
-F8*fh[idx_fh_F_ord2(iF, jF - 1, kF + 2, ex)]
|
||||||
|
+F8*fh[idx_fh_F_ord2(iF, jF + 1, kF + 2, ex)]
|
||||||
|
- fh[idx_fh_F_ord2(iF, jF + 2, kF + 2, ex)] );
|
||||||
|
|
||||||
|
fyz[p] = Fdydz * ( t_km2 - F8 * t_km1 + F8 * t_kp1 - t_kp2 );
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// free(fh);
|
// free(fh);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -81,26 +81,63 @@ void fderivs(const int ex[3],
|
|||||||
}
|
}
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* Fortran loops:
|
* 两段式:
|
||||||
* do k=1,ex3-1
|
* 1) 先在二阶可用区域计算二阶模板
|
||||||
* do j=1,ex2-1
|
* 2) 再在高阶可用区域覆盖为四阶模板
|
||||||
* do i=1,ex1-1
|
|
||||||
*
|
*
|
||||||
* C: k0=0..ex3-2, j0=0..ex2-2, i0=0..ex1-2
|
* 与原 if/elseif 逻辑等价,但减少逐点分支判断。
|
||||||
*/
|
*/
|
||||||
for (int k0 = 0; k0 <= ex3 - 2; ++k0) {
|
const int i2_lo = (iminF > 0) ? iminF : 0;
|
||||||
const int kF = k0 + 1;
|
const int j2_lo = (jminF > 0) ? jminF : 0;
|
||||||
for (int j0 = 0; j0 <= ex2 - 2; ++j0) {
|
const int k2_lo = (kminF > 0) ? kminF : 0;
|
||||||
const int jF = j0 + 1;
|
const int i2_hi = ex1 - 2;
|
||||||
for (int i0 = 0; i0 <= ex1 - 2; ++i0) {
|
const int j2_hi = ex2 - 2;
|
||||||
const int iF = i0 + 1;
|
const int k2_hi = ex3 - 2;
|
||||||
const size_t p = idx_ex(i0, j0, k0, ex);
|
|
||||||
|
const int i4_lo = (iminF + 1 > 0) ? (iminF + 1) : 0;
|
||||||
|
const int j4_lo = (jminF + 1 > 0) ? (jminF + 1) : 0;
|
||||||
|
const int k4_lo = (kminF + 1 > 0) ? (kminF + 1) : 0;
|
||||||
|
const int i4_hi = ex1 - 3;
|
||||||
|
const int j4_hi = ex2 - 3;
|
||||||
|
const int k4_hi = ex3 - 3;
|
||||||
|
|
||||||
|
if (i2_lo <= i2_hi && j2_lo <= j2_hi && k2_lo <= k2_hi) {
|
||||||
|
for (int k0 = k2_lo; k0 <= k2_hi; ++k0) {
|
||||||
|
const int kF = k0 + 1;
|
||||||
|
for (int j0 = j2_lo; j0 <= j2_hi; ++j0) {
|
||||||
|
const int jF = j0 + 1;
|
||||||
|
for (int i0 = i2_lo; i0 <= i2_hi; ++i0) {
|
||||||
|
const int iF = i0 + 1;
|
||||||
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
|
fx[p] = d2dx * (
|
||||||
|
-fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] +
|
||||||
|
fh[idx_fh_F_ord2(iF + 1, jF, kF, ex)]
|
||||||
|
);
|
||||||
|
|
||||||
|
fy[p] = d2dy * (
|
||||||
|
-fh[idx_fh_F_ord2(iF, jF - 1, kF, ex)] +
|
||||||
|
fh[idx_fh_F_ord2(iF, jF + 1, kF, ex)]
|
||||||
|
);
|
||||||
|
|
||||||
|
fz[p] = d2dz * (
|
||||||
|
-fh[idx_fh_F_ord2(iF, jF, kF - 1, ex)] +
|
||||||
|
fh[idx_fh_F_ord2(iF, jF, kF + 1, ex)]
|
||||||
|
);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if (i4_lo <= i4_hi && j4_lo <= j4_hi && k4_lo <= k4_hi) {
|
||||||
|
for (int k0 = k4_lo; k0 <= k4_hi; ++k0) {
|
||||||
|
const int kF = k0 + 1;
|
||||||
|
for (int j0 = j4_lo; j0 <= j4_hi; ++j0) {
|
||||||
|
const int jF = j0 + 1;
|
||||||
|
for (int i0 = i4_lo; i0 <= i4_hi; ++i0) {
|
||||||
|
const int iF = i0 + 1;
|
||||||
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
// if(i+2 <= imax .and. i-2 >= imin ... ) (全是 Fortran 索引)
|
|
||||||
if ((iF + 2) <= imaxF && (iF - 2) >= iminF &&
|
|
||||||
(jF + 2) <= jmaxF && (jF - 2) >= jminF &&
|
|
||||||
(kF + 2) <= kmaxF && (kF - 2) >= kminF)
|
|
||||||
{
|
|
||||||
fx[p] = d12dx * (
|
fx[p] = d12dx * (
|
||||||
fh[idx_fh_F_ord2(iF - 2, jF, kF, ex)] -
|
fh[idx_fh_F_ord2(iF - 2, jF, kF, ex)] -
|
||||||
EIT * fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] +
|
EIT * fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] +
|
||||||
@@ -122,29 +159,9 @@ void fderivs(const int ex[3],
|
|||||||
fh[idx_fh_F_ord2(iF, jF, kF + 2, ex)]
|
fh[idx_fh_F_ord2(iF, jF, kF + 2, ex)]
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
// elseif(i+1 <= imax .and. i-1 >= imin ...)
|
|
||||||
else if ((iF + 1) <= imaxF && (iF - 1) >= iminF &&
|
|
||||||
(jF + 1) <= jmaxF && (jF - 1) >= jminF &&
|
|
||||||
(kF + 1) <= kmaxF && (kF - 1) >= kminF)
|
|
||||||
{
|
|
||||||
fx[p] = d2dx * (
|
|
||||||
-fh[idx_fh_F_ord2(iF - 1, jF, kF, ex)] +
|
|
||||||
fh[idx_fh_F_ord2(iF + 1, jF, kF, ex)]
|
|
||||||
);
|
|
||||||
|
|
||||||
fy[p] = d2dy * (
|
|
||||||
-fh[idx_fh_F_ord2(iF, jF - 1, kF, ex)] +
|
|
||||||
fh[idx_fh_F_ord2(iF, jF + 1, kF, ex)]
|
|
||||||
);
|
|
||||||
|
|
||||||
fz[p] = d2dz * (
|
|
||||||
-fh[idx_fh_F_ord2(iF, jF, kF - 1, ex)] +
|
|
||||||
fh[idx_fh_F_ord2(iF, jF, kF + 1, ex)]
|
|
||||||
);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// free(fh);
|
// free(fh);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1111,27 +1111,177 @@ end subroutine d2dump
|
|||||||
!~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
!~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||||||
!~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
!~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||||||
!~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
!~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||||||
! common code for cell and vertex
|
! common code for cell and vertex
|
||||||
!------------------------------------------------------------------------------
|
!------------------------------------------------------------------------------
|
||||||
! Lagrangian polynomial interpolation
|
! Lagrangian polynomial interpolation
|
||||||
!------------------------------------------------------------------------------
|
!------------------------------------------------------------------------------
|
||||||
|
#ifndef POLINT6_USE_BARYCENTRIC
|
||||||
!DIR$ ATTRIBUTES FORCEINLINE :: polint
|
#define POLINT6_USE_BARYCENTRIC 1
|
||||||
subroutine polint(xa, ya, x, y, dy, ordn)
|
#endif
|
||||||
implicit none
|
|
||||||
|
!DIR$ ATTRIBUTES FORCEINLINE :: polint6_neville
|
||||||
integer, intent(in) :: ordn
|
subroutine polint6_neville(xa, ya, x, y, dy)
|
||||||
|
implicit none
|
||||||
|
|
||||||
|
real*8, dimension(6), intent(in) :: xa, ya
|
||||||
|
real*8, intent(in) :: x
|
||||||
|
real*8, intent(out) :: y, dy
|
||||||
|
|
||||||
|
integer :: i, m, ns, n_m
|
||||||
|
real*8, dimension(6) :: c, d, ho
|
||||||
|
real*8 :: dif, dift, hp, h, den_val
|
||||||
|
|
||||||
|
c = ya
|
||||||
|
d = ya
|
||||||
|
ho = xa - x
|
||||||
|
|
||||||
|
ns = 1
|
||||||
|
dif = abs(x - xa(1))
|
||||||
|
|
||||||
|
do i = 2, 6
|
||||||
|
dift = abs(x - xa(i))
|
||||||
|
if (dift < dif) then
|
||||||
|
ns = i
|
||||||
|
dif = dift
|
||||||
|
end if
|
||||||
|
end do
|
||||||
|
|
||||||
|
y = ya(ns)
|
||||||
|
ns = ns - 1
|
||||||
|
|
||||||
|
do m = 1, 5
|
||||||
|
n_m = 6 - m
|
||||||
|
do i = 1, n_m
|
||||||
|
hp = ho(i)
|
||||||
|
h = ho(i+m)
|
||||||
|
den_val = hp - h
|
||||||
|
|
||||||
|
if (den_val == 0.0d0) then
|
||||||
|
write(*,*) 'failure in polint for point',x
|
||||||
|
write(*,*) 'with input points: ',xa
|
||||||
|
stop
|
||||||
|
end if
|
||||||
|
|
||||||
|
den_val = (c(i+1) - d(i)) / den_val
|
||||||
|
|
||||||
|
d(i) = h * den_val
|
||||||
|
c(i) = hp * den_val
|
||||||
|
end do
|
||||||
|
|
||||||
|
if (2 * ns < n_m) then
|
||||||
|
dy = c(ns + 1)
|
||||||
|
else
|
||||||
|
dy = d(ns)
|
||||||
|
ns = ns - 1
|
||||||
|
end if
|
||||||
|
y = y + dy
|
||||||
|
end do
|
||||||
|
|
||||||
|
return
|
||||||
|
end subroutine polint6_neville
|
||||||
|
|
||||||
|
!DIR$ ATTRIBUTES FORCEINLINE :: polint6_barycentric
|
||||||
|
subroutine polint6_barycentric(xa, ya, x, y, dy)
|
||||||
|
implicit none
|
||||||
|
|
||||||
|
real*8, dimension(6), intent(in) :: xa, ya
|
||||||
|
real*8, intent(in) :: x
|
||||||
|
real*8, intent(out) :: y, dy
|
||||||
|
|
||||||
|
integer :: i, j
|
||||||
|
logical :: is_uniform
|
||||||
|
real*8, dimension(6) :: lambda
|
||||||
|
real*8 :: dx, den_i, term, num, den, step, tol
|
||||||
|
real*8, parameter :: c_uniform(6) = (/ -1.d0, 5.d0, -10.d0, 10.d0, -5.d0, 1.d0 /)
|
||||||
|
|
||||||
|
do i = 1, 6
|
||||||
|
if (x == xa(i)) then
|
||||||
|
y = ya(i)
|
||||||
|
dy = 0.d0
|
||||||
|
return
|
||||||
|
end if
|
||||||
|
end do
|
||||||
|
|
||||||
|
step = xa(2) - xa(1)
|
||||||
|
is_uniform = (step /= 0.d0)
|
||||||
|
if (is_uniform) then
|
||||||
|
tol = 64.d0 * epsilon(1.d0) * max(1.d0, abs(step))
|
||||||
|
do i = 3, 6
|
||||||
|
if (abs((xa(i) - xa(i-1)) - step) > tol) then
|
||||||
|
is_uniform = .false.
|
||||||
|
exit
|
||||||
|
end if
|
||||||
|
end do
|
||||||
|
end if
|
||||||
|
|
||||||
|
if (is_uniform) then
|
||||||
|
num = 0.d0
|
||||||
|
den = 0.d0
|
||||||
|
do i = 1, 6
|
||||||
|
term = c_uniform(i) / (x - xa(i))
|
||||||
|
num = num + term * ya(i)
|
||||||
|
den = den + term
|
||||||
|
end do
|
||||||
|
y = num / den
|
||||||
|
dy = 0.d0
|
||||||
|
return
|
||||||
|
end if
|
||||||
|
|
||||||
|
do i = 1, 6
|
||||||
|
den_i = 1.d0
|
||||||
|
do j = 1, 6
|
||||||
|
if (j /= i) then
|
||||||
|
dx = xa(i) - xa(j)
|
||||||
|
if (dx == 0.0d0) then
|
||||||
|
write(*,*) 'failure in polint for point',x
|
||||||
|
write(*,*) 'with input points: ',xa
|
||||||
|
stop
|
||||||
|
end if
|
||||||
|
den_i = den_i * dx
|
||||||
|
end if
|
||||||
|
end do
|
||||||
|
lambda(i) = 1.d0 / den_i
|
||||||
|
end do
|
||||||
|
|
||||||
|
num = 0.d0
|
||||||
|
den = 0.d0
|
||||||
|
do i = 1, 6
|
||||||
|
term = lambda(i) / (x - xa(i))
|
||||||
|
num = num + term * ya(i)
|
||||||
|
den = den + term
|
||||||
|
end do
|
||||||
|
|
||||||
|
y = num / den
|
||||||
|
dy = 0.d0
|
||||||
|
|
||||||
|
return
|
||||||
|
end subroutine polint6_barycentric
|
||||||
|
|
||||||
|
!DIR$ ATTRIBUTES FORCEINLINE :: polint
|
||||||
|
subroutine polint(xa, ya, x, y, dy, ordn)
|
||||||
|
implicit none
|
||||||
|
|
||||||
|
integer, intent(in) :: ordn
|
||||||
real*8, dimension(ordn), intent(in) :: xa, ya
|
real*8, dimension(ordn), intent(in) :: xa, ya
|
||||||
real*8, intent(in) :: x
|
real*8, intent(in) :: x
|
||||||
real*8, intent(out) :: y, dy
|
real*8, intent(out) :: y, dy
|
||||||
|
|
||||||
integer :: i, m, ns, n_m
|
integer :: i, m, ns, n_m
|
||||||
real*8, dimension(ordn) :: c, d, ho
|
real*8, dimension(ordn) :: c, d, ho
|
||||||
real*8 :: dif, dift, hp, h, den_val
|
real*8 :: dif, dift, hp, h, den_val
|
||||||
|
|
||||||
c = ya
|
if (ordn == 6) then
|
||||||
d = ya
|
#if POLINT6_USE_BARYCENTRIC
|
||||||
ho = xa - x
|
call polint6_barycentric(xa, ya, x, y, dy)
|
||||||
|
#else
|
||||||
|
call polint6_neville(xa, ya, x, y, dy)
|
||||||
|
#endif
|
||||||
|
return
|
||||||
|
end if
|
||||||
|
|
||||||
|
c = ya
|
||||||
|
d = ya
|
||||||
|
ho = xa - x
|
||||||
|
|
||||||
ns = 1
|
ns = 1
|
||||||
dif = abs(x - xa(1))
|
dif = abs(x - xa(1))
|
||||||
@@ -1175,13 +1325,48 @@ end subroutine d2dump
|
|||||||
y = y + dy
|
y = y + dy
|
||||||
end do
|
end do
|
||||||
|
|
||||||
return
|
return
|
||||||
end subroutine polint
|
end subroutine polint
|
||||||
!------------------------------------------------------------------------------
|
!------------------------------------------------------------------------------
|
||||||
!
|
! Compute Lagrange interpolation basis weights for one target point.
|
||||||
! interpolation in 2 dimensions, follow yx order
|
!------------------------------------------------------------------------------
|
||||||
!
|
!DIR$ ATTRIBUTES FORCEINLINE :: polint_lagrange_weights
|
||||||
!------------------------------------------------------------------------------
|
subroutine polint_lagrange_weights(xa, x, w, ordn)
|
||||||
|
implicit none
|
||||||
|
|
||||||
|
integer, intent(in) :: ordn
|
||||||
|
real*8, dimension(1:ordn), intent(in) :: xa
|
||||||
|
real*8, intent(in) :: x
|
||||||
|
real*8, dimension(1:ordn), intent(out) :: w
|
||||||
|
|
||||||
|
integer :: i, j
|
||||||
|
real*8 :: num, den, dx
|
||||||
|
|
||||||
|
do i = 1, ordn
|
||||||
|
num = 1.d0
|
||||||
|
den = 1.d0
|
||||||
|
do j = 1, ordn
|
||||||
|
if (j /= i) then
|
||||||
|
dx = xa(i) - xa(j)
|
||||||
|
if (dx == 0.0d0) then
|
||||||
|
write(*,*) 'failure in polint for point',x
|
||||||
|
write(*,*) 'with input points: ',xa
|
||||||
|
stop
|
||||||
|
end if
|
||||||
|
num = num * (x - xa(j))
|
||||||
|
den = den * dx
|
||||||
|
end if
|
||||||
|
end do
|
||||||
|
w(i) = num / den
|
||||||
|
end do
|
||||||
|
|
||||||
|
return
|
||||||
|
end subroutine polint_lagrange_weights
|
||||||
|
!------------------------------------------------------------------------------
|
||||||
|
!
|
||||||
|
! interpolation in 2 dimensions, follow yx order
|
||||||
|
!
|
||||||
|
!------------------------------------------------------------------------------
|
||||||
subroutine polin2(x1a,x2a,ya,x1,x2,y,dy,ordn)
|
subroutine polin2(x1a,x2a,ya,x1,x2,y,dy,ordn)
|
||||||
implicit none
|
implicit none
|
||||||
|
|
||||||
@@ -1229,11 +1414,11 @@ end subroutine d2dump
|
|||||||
real*8, intent(in) :: x1,x2,x3
|
real*8, intent(in) :: x1,x2,x3
|
||||||
real*8, intent(out) :: y,dy
|
real*8, intent(out) :: y,dy
|
||||||
|
|
||||||
#ifdef POLINT_LEGACY_ORDER
|
#ifdef POLINT_LEGACY_ORDER
|
||||||
integer :: i,j,m,n
|
integer :: i,j,m,n
|
||||||
real*8, dimension(ordn,ordn) :: yatmp
|
real*8, dimension(ordn,ordn) :: yatmp
|
||||||
real*8, dimension(ordn) :: ymtmp
|
real*8, dimension(ordn) :: ymtmp
|
||||||
real*8, dimension(ordn) :: yntmp
|
real*8, dimension(ordn) :: yntmp
|
||||||
real*8, dimension(ordn) :: yqtmp
|
real*8, dimension(ordn) :: yqtmp
|
||||||
|
|
||||||
m=size(x1a)
|
m=size(x1a)
|
||||||
@@ -1243,29 +1428,36 @@ end subroutine d2dump
|
|||||||
yqtmp=ya(i,j,:)
|
yqtmp=ya(i,j,:)
|
||||||
call polint(x3a,yqtmp,x3,yatmp(i,j),dy,ordn)
|
call polint(x3a,yqtmp,x3,yatmp(i,j),dy,ordn)
|
||||||
end do
|
end do
|
||||||
yntmp=yatmp(i,:)
|
yntmp=yatmp(i,:)
|
||||||
call polint(x2a,yntmp,x2,ymtmp(i),dy,ordn)
|
call polint(x2a,yntmp,x2,ymtmp(i),dy,ordn)
|
||||||
end do
|
end do
|
||||||
call polint(x1a,ymtmp,x1,y,dy,ordn)
|
call polint(x1a,ymtmp,x1,y,dy,ordn)
|
||||||
#else
|
#else
|
||||||
integer :: j, k
|
integer :: i, j, k
|
||||||
real*8, dimension(ordn,ordn) :: yatmp
|
real*8, dimension(ordn) :: w1, w2
|
||||||
real*8, dimension(ordn) :: ymtmp
|
real*8, dimension(ordn) :: ymtmp
|
||||||
real*8 :: dy_temp
|
real*8 :: yx_sum, x_sum
|
||||||
|
|
||||||
do k=1,ordn
|
call polint_lagrange_weights(x1a, x1, w1, ordn)
|
||||||
do j=1,ordn
|
call polint_lagrange_weights(x2a, x2, w2, ordn)
|
||||||
call polint(x1a, ya(:,j,k), x1, yatmp(j,k), dy_temp, ordn)
|
|
||||||
end do
|
do k = 1, ordn
|
||||||
end do
|
yx_sum = 0.d0
|
||||||
do k=1,ordn
|
do j = 1, ordn
|
||||||
call polint(x2a, yatmp(:,k), x2, ymtmp(k), dy_temp, ordn)
|
x_sum = 0.d0
|
||||||
end do
|
do i = 1, ordn
|
||||||
call polint(x3a, ymtmp, x3, y, dy, ordn)
|
x_sum = x_sum + w1(i) * ya(i,j,k)
|
||||||
#endif
|
end do
|
||||||
|
yx_sum = yx_sum + w2(j) * x_sum
|
||||||
return
|
end do
|
||||||
end subroutine polin3
|
ymtmp(k) = yx_sum
|
||||||
|
end do
|
||||||
|
|
||||||
|
call polint(x3a, ymtmp, x3, y, dy, ordn)
|
||||||
|
#endif
|
||||||
|
|
||||||
|
return
|
||||||
|
end subroutine polin3
|
||||||
!--------------------------------------------------------------------------------------
|
!--------------------------------------------------------------------------------------
|
||||||
! calculate L2norm
|
! calculate L2norm
|
||||||
subroutine l2normhelper(ex, X, Y, Z,xmin,ymin,zmin,xmax,ymax,zmax,&
|
subroutine l2normhelper(ex, X, Y, Z,xmin,ymin,zmin,xmax,ymax,zmax,&
|
||||||
@@ -1319,13 +1511,88 @@ deallocate(f_flat)
|
|||||||
|
|
||||||
f_out = f_out*dX*dY*dZ
|
f_out = f_out*dX*dY*dZ
|
||||||
|
|
||||||
return
|
return
|
||||||
|
|
||||||
end subroutine l2normhelper
|
end subroutine l2normhelper
|
||||||
!--------------------------------------------------------------------------------------
|
!--------------------------------------------------------------------------------------
|
||||||
! calculate L2norm especially for shell Blocks
|
subroutine l2normhelper7(ex, X, Y, Z,xmin,ymin,zmin,xmax,ymax,zmax,&
|
||||||
subroutine l2normhelper_sh(ex, X, Y, Z,xmin,ymin,zmin,xmax,ymax,zmax,&
|
f1,f2,f3,f4,f5,f6,f7,f_out,gw)
|
||||||
f,f_out,gw,ogw,Symmetry)
|
|
||||||
|
implicit none
|
||||||
|
!~~~~~~> Input parameters:
|
||||||
|
integer,intent(in ):: ex(1:3)
|
||||||
|
real*8, intent(in ):: X(1:ex(1)),Y(1:ex(2)),Z(1:ex(3)),xmin,ymin,zmin,xmax,ymax,zmax
|
||||||
|
integer,intent(in)::gw
|
||||||
|
real*8, dimension(ex(1),ex(2),ex(3)),intent(in) :: f1,f2,f3,f4,f5,f6,f7
|
||||||
|
real*8, intent(out) :: f_out(7)
|
||||||
|
!~~~~~~> Other variables:
|
||||||
|
|
||||||
|
real*8 :: dX, dY, dZ
|
||||||
|
integer::imin,jmin,kmin
|
||||||
|
integer::imax,jmax,kmax
|
||||||
|
integer::i,j,k
|
||||||
|
real*8 :: s1,s2,s3,s4,s5,s6,s7
|
||||||
|
|
||||||
|
dX = X(2) - X(1)
|
||||||
|
dY = Y(2) - Y(1)
|
||||||
|
dZ = Z(2) - Z(1)
|
||||||
|
|
||||||
|
! for ghost zone
|
||||||
|
imin = gw+1
|
||||||
|
jmin = gw+1
|
||||||
|
kmin = gw+1
|
||||||
|
|
||||||
|
imax = ex(1) - gw
|
||||||
|
jmax = ex(2) - gw
|
||||||
|
kmax = ex(3) - gw
|
||||||
|
|
||||||
|
!for patch boundary (i.e., not ghost boundary)
|
||||||
|
|
||||||
|
if(dabs(X(ex(1))-xmax) < dX) imax = ex(1)
|
||||||
|
if(dabs(Y(ex(2))-ymax) < dY) jmax = ex(2)
|
||||||
|
if(dabs(Z(ex(3))-zmax) < dZ) kmax = ex(3)
|
||||||
|
if(dabs(X(1)-xmin) < dX) imin = 1
|
||||||
|
if(dabs(Y(1)-ymin) < dY) jmin = 1
|
||||||
|
if(dabs(Z(1)-zmin) < dZ) kmin = 1
|
||||||
|
|
||||||
|
s1 = 0.d0
|
||||||
|
s2 = 0.d0
|
||||||
|
s3 = 0.d0
|
||||||
|
s4 = 0.d0
|
||||||
|
s5 = 0.d0
|
||||||
|
s6 = 0.d0
|
||||||
|
s7 = 0.d0
|
||||||
|
|
||||||
|
do k=kmin,kmax
|
||||||
|
do j=jmin,jmax
|
||||||
|
!DIR$ SIMD REDUCTION(+:s1,s2,s3,s4,s5,s6,s7)
|
||||||
|
do i=imin,imax
|
||||||
|
s1 = s1 + f1(i,j,k)*f1(i,j,k)
|
||||||
|
s2 = s2 + f2(i,j,k)*f2(i,j,k)
|
||||||
|
s3 = s3 + f3(i,j,k)*f3(i,j,k)
|
||||||
|
s4 = s4 + f4(i,j,k)*f4(i,j,k)
|
||||||
|
s5 = s5 + f5(i,j,k)*f5(i,j,k)
|
||||||
|
s6 = s6 + f6(i,j,k)*f6(i,j,k)
|
||||||
|
s7 = s7 + f7(i,j,k)*f7(i,j,k)
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
enddo
|
||||||
|
|
||||||
|
f_out(1) = s1*dX*dY*dZ
|
||||||
|
f_out(2) = s2*dX*dY*dZ
|
||||||
|
f_out(3) = s3*dX*dY*dZ
|
||||||
|
f_out(4) = s4*dX*dY*dZ
|
||||||
|
f_out(5) = s5*dX*dY*dZ
|
||||||
|
f_out(6) = s6*dX*dY*dZ
|
||||||
|
f_out(7) = s7*dX*dY*dZ
|
||||||
|
|
||||||
|
return
|
||||||
|
|
||||||
|
end subroutine l2normhelper7
|
||||||
|
!--------------------------------------------------------------------------------------
|
||||||
|
! calculate L2norm especially for shell Blocks
|
||||||
|
subroutine l2normhelper_sh(ex, X, Y, Z,xmin,ymin,zmin,xmax,ymax,zmax,&
|
||||||
|
f,f_out,gw,ogw,Symmetry)
|
||||||
|
|
||||||
implicit none
|
implicit none
|
||||||
!~~~~~~> Input parameters:
|
!~~~~~~> Input parameters:
|
||||||
@@ -1608,11 +1875,14 @@ deallocate(f_flat)
|
|||||||
! ^
|
! ^
|
||||||
! f=3/8*f_1 + 3/4*f_2 - 1/8*f_3
|
! f=3/8*f_1 + 3/4*f_2 - 1/8*f_3
|
||||||
|
|
||||||
real*8,parameter::C1=3.d0/8.d0,C2=3.d0/4.d0,C3=-1.d0/8.d0
|
real*8,parameter::C1=3.d0/8.d0,C2=3.d0/4.d0,C3=-1.d0/8.d0
|
||||||
|
integer :: i,j,k
|
||||||
fout = C1*f1+C2*f2+C3*f3
|
|
||||||
|
do concurrent (k=1:ext(3), j=1:ext(2), i=1:ext(1))
|
||||||
return
|
fout(i,j,k) = C1*f1(i,j,k)+C2*f2(i,j,k)+C3*f3(i,j,k)
|
||||||
|
end do
|
||||||
|
|
||||||
|
return
|
||||||
|
|
||||||
end subroutine average2
|
end subroutine average2
|
||||||
!-----------------------------------------------------------------------------
|
!-----------------------------------------------------------------------------
|
||||||
|
|||||||
@@ -12,9 +12,10 @@
|
|||||||
#define f_global_interpind global_interpind
|
#define f_global_interpind global_interpind
|
||||||
#define f_global_interpind2d global_interpind2d
|
#define f_global_interpind2d global_interpind2d
|
||||||
#define f_global_interpind1d global_interpind1d
|
#define f_global_interpind1d global_interpind1d
|
||||||
#define f_l2normhelper l2normhelper
|
#define f_l2normhelper l2normhelper
|
||||||
#define f_l2normhelper_sh l2normhelper_sh
|
#define f_l2normhelper7 l2normhelper7
|
||||||
#define f_l2normhelper_sh_rms l2normhelper_sh_rms
|
#define f_l2normhelper_sh l2normhelper_sh
|
||||||
|
#define f_l2normhelper_sh_rms l2normhelper_sh_rms
|
||||||
#define f_average average
|
#define f_average average
|
||||||
#define f_average3 average3
|
#define f_average3 average3
|
||||||
#define f_average2 average2
|
#define f_average2 average2
|
||||||
@@ -41,9 +42,10 @@
|
|||||||
#define f_global_interpind GLOBAL_INTERPIND
|
#define f_global_interpind GLOBAL_INTERPIND
|
||||||
#define f_global_interpind2d GLOBAL_INTERPIND2D
|
#define f_global_interpind2d GLOBAL_INTERPIND2D
|
||||||
#define f_global_interpind1d GLOBAL_INTERPIND1D
|
#define f_global_interpind1d GLOBAL_INTERPIND1D
|
||||||
#define f_l2normhelper L2NORMHELPER
|
#define f_l2normhelper L2NORMHELPER
|
||||||
#define f_l2normhelper_sh L2NORMHELPER_SH
|
#define f_l2normhelper7 L2NORMHELPER7
|
||||||
#define f_l2normhelper_sh_rms L2NORMHELPER_SH_RMS
|
#define f_l2normhelper_sh L2NORMHELPER_SH
|
||||||
|
#define f_l2normhelper_sh_rms L2NORMHELPER_SH_RMS
|
||||||
#define f_average AVERAGE
|
#define f_average AVERAGE
|
||||||
#define f_average3 AVERAGE3
|
#define f_average3 AVERAGE3
|
||||||
#define f_average2 AVERAGE2
|
#define f_average2 AVERAGE2
|
||||||
@@ -70,9 +72,10 @@
|
|||||||
#define f_global_interpind global_interpind_
|
#define f_global_interpind global_interpind_
|
||||||
#define f_global_interpind2d global_interpind2d_
|
#define f_global_interpind2d global_interpind2d_
|
||||||
#define f_global_interpind1d global_interpind1d_
|
#define f_global_interpind1d global_interpind1d_
|
||||||
#define f_l2normhelper l2normhelper_
|
#define f_l2normhelper l2normhelper_
|
||||||
#define f_l2normhelper_sh l2normhelper_sh_
|
#define f_l2normhelper7 l2normhelper7_
|
||||||
#define f_l2normhelper_sh_rms l2normhelper_sh_rms_
|
#define f_l2normhelper_sh l2normhelper_sh_
|
||||||
|
#define f_l2normhelper_sh_rms l2normhelper_sh_rms_
|
||||||
#define f_average average_
|
#define f_average average_
|
||||||
#define f_average3 average3_
|
#define f_average3 average3_
|
||||||
#define f_average2 average2_
|
#define f_average2 average2_
|
||||||
@@ -156,20 +159,29 @@ extern "C"
|
|||||||
int *, double *, int &, int &);
|
int *, double *, int &, int &);
|
||||||
}
|
}
|
||||||
|
|
||||||
extern "C"
|
extern "C"
|
||||||
{
|
{
|
||||||
void f_l2normhelper(int *, double *, double *, double *,
|
void f_l2normhelper(int *, double *, double *, double *,
|
||||||
double &, double &, double &,
|
double &, double &, double &,
|
||||||
double &, double &, double &,
|
double &, double &, double &,
|
||||||
double *, double &, int &);
|
double *, double &, int &);
|
||||||
}
|
}
|
||||||
|
|
||||||
extern "C"
|
extern "C"
|
||||||
{
|
{
|
||||||
void f_l2normhelper_sh(int *, double *, double *, double *,
|
void f_l2normhelper7(int *, double *, double *, double *,
|
||||||
double &, double &, double &,
|
double &, double &, double &,
|
||||||
double &, double &, double &,
|
double &, double &, double &,
|
||||||
double *, double &, int &, int &, int &);
|
double *, double *, double *, double *,
|
||||||
|
double *, double *, double *, double *, int &);
|
||||||
|
}
|
||||||
|
|
||||||
|
extern "C"
|
||||||
|
{
|
||||||
|
void f_l2normhelper_sh(int *, double *, double *, double *,
|
||||||
|
double &, double &, double &,
|
||||||
|
double &, double &, double &,
|
||||||
|
double *, double &, int &, int &, int &);
|
||||||
}
|
}
|
||||||
|
|
||||||
extern "C"
|
extern "C"
|
||||||
|
|||||||
@@ -18,7 +18,7 @@ using namespace std;
|
|||||||
#endif
|
#endif
|
||||||
|
|
||||||
// Intel oneMKL LAPACK interface
|
// Intel oneMKL LAPACK interface
|
||||||
#include <mkl_lapacke.h>
|
#include <lapacke.h>
|
||||||
/* Linear equation solution using Intel oneMKL LAPACK.
|
/* Linear equation solution using Intel oneMKL LAPACK.
|
||||||
a[0..n-1][0..n-1] is the input matrix. b[0..n-1] is input
|
a[0..n-1][0..n-1] is the input matrix. b[0..n-1] is input
|
||||||
containing the right-hand side vectors. On output a is
|
containing the right-hand side vectors. On output a is
|
||||||
|
|||||||
@@ -1,3 +1,5 @@
|
|||||||
|
/* 本头文件由自订profile框架自动生成并非人工硬编码针对Case优化 */
|
||||||
|
/* 更新:负载均衡问题已经通过优化插值函数解决,此profile静态均衡方案已弃用,本头文件现在未参与编译 */
|
||||||
/* Auto-generated from interp_lb_profile.bin — do not edit */
|
/* Auto-generated from interp_lb_profile.bin — do not edit */
|
||||||
#ifndef INTERP_LB_PROFILE_DATA_H
|
#ifndef INTERP_LB_PROFILE_DATA_H
|
||||||
#define INTERP_LB_PROFILE_DATA_H
|
#define INTERP_LB_PROFILE_DATA_H
|
||||||
|
|||||||
@@ -63,19 +63,28 @@ void kodis(const int ex[3],
|
|||||||
* C: k0=0..ex3-1, j0=0..ex2-1, i0=0..ex1-1
|
* C: k0=0..ex3-1, j0=0..ex2-1, i0=0..ex1-1
|
||||||
* 并定义 Fortran index: iF=i0+1, ...
|
* 并定义 Fortran index: iF=i0+1, ...
|
||||||
*/
|
*/
|
||||||
for (int k0 = 0; k0 < ex3; ++k0) {
|
// 收紧循环范围:只遍历满足 iF±3/jF±3/kF±3 条件的内部点
|
||||||
|
// iF-3 >= iminF => iF >= iminF+3 => i0 >= iminF+2 (因为 iF=i0+1)
|
||||||
|
// iF+3 <= imaxF => iF <= imaxF-3 => i0 <= imaxF-4
|
||||||
|
const int i0_lo = (iminF + 2 > 0) ? iminF + 2 : 0;
|
||||||
|
const int j0_lo = (jminF + 2 > 0) ? jminF + 2 : 0;
|
||||||
|
const int k0_lo = (kminF + 2 > 0) ? kminF + 2 : 0;
|
||||||
|
const int i0_hi = imaxF - 4; // inclusive
|
||||||
|
const int j0_hi = jmaxF - 4;
|
||||||
|
const int k0_hi = kmaxF - 4;
|
||||||
|
|
||||||
|
if (i0_lo > i0_hi || j0_lo > j0_hi || k0_lo > k0_hi) {
|
||||||
|
free(fh);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int k0 = k0_lo; k0 <= k0_hi; ++k0) {
|
||||||
const int kF = k0 + 1;
|
const int kF = k0 + 1;
|
||||||
for (int j0 = 0; j0 < ex2; ++j0) {
|
for (int j0 = j0_lo; j0 <= j0_hi; ++j0) {
|
||||||
const int jF = j0 + 1;
|
const int jF = j0 + 1;
|
||||||
for (int i0 = 0; i0 < ex1; ++i0) {
|
for (int i0 = i0_lo; i0 <= i0_hi; ++i0) {
|
||||||
const int iF = i0 + 1;
|
const int iF = i0 + 1;
|
||||||
|
|
||||||
// Fortran if 条件:
|
|
||||||
// i-3 >= imin .and. i+3 <= imax 等(都是 Fortran 索引)
|
|
||||||
if ((iF - 3) >= iminF && (iF + 3) <= imaxF &&
|
|
||||||
(jF - 3) >= jminF && (jF + 3) <= jmaxF &&
|
|
||||||
(kF - 3) >= kminF && (kF + 3) <= kmaxF)
|
|
||||||
{
|
|
||||||
const size_t p = idx_ex(i0, j0, k0, ex);
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
// 三个方向各一份同型的 7 点组合(实际上是对称的 6th-order dissipation/filter 核)
|
// 三个方向各一份同型的 7 点组合(实际上是对称的 6th-order dissipation/filter 核)
|
||||||
@@ -100,7 +109,6 @@ void kodis(const int ex[3],
|
|||||||
// Fortran:
|
// Fortran:
|
||||||
// f_rhs(i,j,k) = f_rhs(i,j,k) + eps/cof*(Dx_term + Dy_term + Dz_term)
|
// f_rhs(i,j,k) = f_rhs(i,j,k) + eps/cof*(Dx_term + Dy_term + Dz_term)
|
||||||
f_rhs[p] += (eps / cof) * (Dx_term + Dy_term + Dz_term);
|
f_rhs[p] += (eps / cof) * (Dx_term + Dy_term + Dz_term);
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
248
AMSS_NCKU_source/lopsided_kodis_c.C
Normal file
248
AMSS_NCKU_source/lopsided_kodis_c.C
Normal file
@@ -0,0 +1,248 @@
|
|||||||
|
#include "tool.h"
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Combined advection (lopsided) + KO dissipation (kodis).
|
||||||
|
* Uses one shared symmetry_bd buffer per call.
|
||||||
|
*/
|
||||||
|
void lopsided_kodis(const int ex[3],
|
||||||
|
const double *X, const double *Y, const double *Z,
|
||||||
|
const double *f, double *f_rhs,
|
||||||
|
const double *Sfx, const double *Sfy, const double *Sfz,
|
||||||
|
int Symmetry, const double SoA[3], double eps)
|
||||||
|
{
|
||||||
|
const double ZEO = 0.0, ONE = 1.0, F3 = 3.0;
|
||||||
|
const double F6 = 6.0, F18 = 18.0;
|
||||||
|
const double F12 = 12.0, F10 = 10.0, EIT = 8.0;
|
||||||
|
const double SIX = 6.0, FIT = 15.0, TWT = 20.0;
|
||||||
|
const double cof = 64.0; // 2^6
|
||||||
|
|
||||||
|
const int NO_SYMM = 0, EQ_SYMM = 1;
|
||||||
|
|
||||||
|
const int ex1 = ex[0], ex2 = ex[1], ex3 = ex[2];
|
||||||
|
|
||||||
|
const double dX = X[1] - X[0];
|
||||||
|
const double dY = Y[1] - Y[0];
|
||||||
|
const double dZ = Z[1] - Z[0];
|
||||||
|
|
||||||
|
const double d12dx = ONE / F12 / dX;
|
||||||
|
const double d12dy = ONE / F12 / dY;
|
||||||
|
const double d12dz = ONE / F12 / dZ;
|
||||||
|
|
||||||
|
const int imaxF = ex1;
|
||||||
|
const int jmaxF = ex2;
|
||||||
|
const int kmaxF = ex3;
|
||||||
|
|
||||||
|
int iminF = 1, jminF = 1, kminF = 1;
|
||||||
|
if (Symmetry > NO_SYMM && fabs(Z[0]) < dZ) kminF = -2;
|
||||||
|
if (Symmetry > EQ_SYMM && fabs(X[0]) < dX) iminF = -2;
|
||||||
|
if (Symmetry > EQ_SYMM && fabs(Y[0]) < dY) jminF = -2;
|
||||||
|
|
||||||
|
// fh for Fortran-style domain (-2:ex1,-2:ex2,-2:ex3)
|
||||||
|
const size_t nx = (size_t)ex1 + 3;
|
||||||
|
const size_t ny = (size_t)ex2 + 3;
|
||||||
|
const size_t nz = (size_t)ex3 + 3;
|
||||||
|
const size_t fh_size = nx * ny * nz;
|
||||||
|
|
||||||
|
double *fh = (double*)malloc(fh_size * sizeof(double));
|
||||||
|
if (!fh) return;
|
||||||
|
|
||||||
|
symmetry_bd(3, ex, f, fh, SoA);
|
||||||
|
|
||||||
|
// Advection (same stencil logic as lopsided_c.C)
|
||||||
|
for (int k0 = 0; k0 <= ex3 - 2; ++k0) {
|
||||||
|
const int kF = k0 + 1;
|
||||||
|
for (int j0 = 0; j0 <= ex2 - 2; ++j0) {
|
||||||
|
const int jF = j0 + 1;
|
||||||
|
for (int i0 = 0; i0 <= ex1 - 2; ++i0) {
|
||||||
|
const int iF = i0 + 1;
|
||||||
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
|
const double sfx = Sfx[p];
|
||||||
|
if (sfx > ZEO) {
|
||||||
|
if (i0 <= ex1 - 4) {
|
||||||
|
f_rhs[p] += sfx * d12dx *
|
||||||
|
(-F3 * fh[idx_fh_F(iF - 1, jF, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF , jF, kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF + 1, jF, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF + 2, jF, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF + 3, jF, kF, ex)]);
|
||||||
|
} else if (i0 <= ex1 - 3) {
|
||||||
|
f_rhs[p] += sfx * d12dx *
|
||||||
|
( fh[idx_fh_F(iF - 2, jF, kF, ex)]
|
||||||
|
-EIT * fh[idx_fh_F(iF - 1, jF, kF, ex)]
|
||||||
|
+EIT * fh[idx_fh_F(iF + 1, jF, kF, ex)]
|
||||||
|
- fh[idx_fh_F(iF + 2, jF, kF, ex)]);
|
||||||
|
} else if (i0 <= ex1 - 2) {
|
||||||
|
f_rhs[p] -= sfx * d12dx *
|
||||||
|
(-F3 * fh[idx_fh_F(iF + 1, jF, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF , jF, kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF - 1, jF, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF - 2, jF, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF - 3, jF, kF, ex)]);
|
||||||
|
}
|
||||||
|
} else if (sfx < ZEO) {
|
||||||
|
if ((i0 - 2) >= iminF) {
|
||||||
|
f_rhs[p] -= sfx * d12dx *
|
||||||
|
(-F3 * fh[idx_fh_F(iF + 1, jF, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF , jF, kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF - 1, jF, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF - 2, jF, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF - 3, jF, kF, ex)]);
|
||||||
|
} else if ((i0 - 1) >= iminF) {
|
||||||
|
f_rhs[p] += sfx * d12dx *
|
||||||
|
( fh[idx_fh_F(iF - 2, jF, kF, ex)]
|
||||||
|
-EIT * fh[idx_fh_F(iF - 1, jF, kF, ex)]
|
||||||
|
+EIT * fh[idx_fh_F(iF + 1, jF, kF, ex)]
|
||||||
|
- fh[idx_fh_F(iF + 2, jF, kF, ex)]);
|
||||||
|
} else if (i0 >= iminF) {
|
||||||
|
f_rhs[p] += sfx * d12dx *
|
||||||
|
(-F3 * fh[idx_fh_F(iF - 1, jF, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF , jF, kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF + 1, jF, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF + 2, jF, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF + 3, jF, kF, ex)]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
const double sfy = Sfy[p];
|
||||||
|
if (sfy > ZEO) {
|
||||||
|
if (j0 <= ex2 - 4) {
|
||||||
|
f_rhs[p] += sfy * d12dy *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF - 1, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF , kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF + 1, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF + 2, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF + 3, kF, ex)]);
|
||||||
|
} else if (j0 <= ex2 - 3) {
|
||||||
|
f_rhs[p] += sfy * d12dy *
|
||||||
|
( fh[idx_fh_F(iF, jF - 2, kF, ex)]
|
||||||
|
-EIT * fh[idx_fh_F(iF, jF - 1, kF, ex)]
|
||||||
|
+EIT * fh[idx_fh_F(iF, jF + 1, kF, ex)]
|
||||||
|
- fh[idx_fh_F(iF, jF + 2, kF, ex)]);
|
||||||
|
} else if (j0 <= ex2 - 2) {
|
||||||
|
f_rhs[p] -= sfy * d12dy *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF + 1, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF , kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF - 1, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF - 2, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF - 3, kF, ex)]);
|
||||||
|
}
|
||||||
|
} else if (sfy < ZEO) {
|
||||||
|
if ((j0 - 2) >= jminF) {
|
||||||
|
f_rhs[p] -= sfy * d12dy *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF + 1, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF , kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF - 1, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF - 2, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF - 3, kF, ex)]);
|
||||||
|
} else if ((j0 - 1) >= jminF) {
|
||||||
|
f_rhs[p] += sfy * d12dy *
|
||||||
|
( fh[idx_fh_F(iF, jF - 2, kF, ex)]
|
||||||
|
-EIT * fh[idx_fh_F(iF, jF - 1, kF, ex)]
|
||||||
|
+EIT * fh[idx_fh_F(iF, jF + 1, kF, ex)]
|
||||||
|
- fh[idx_fh_F(iF, jF + 2, kF, ex)]);
|
||||||
|
} else if (j0 >= jminF) {
|
||||||
|
f_rhs[p] += sfy * d12dy *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF - 1, kF, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF , kF, ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF + 1, kF, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF + 2, kF, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF + 3, kF, ex)]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
const double sfz = Sfz[p];
|
||||||
|
if (sfz > ZEO) {
|
||||||
|
if (k0 <= ex3 - 4) {
|
||||||
|
f_rhs[p] += sfz * d12dz *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF, kF - 1, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF, kF , ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF, kF + 1, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF, kF + 2, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF, kF + 3, ex)]);
|
||||||
|
} else if (k0 <= ex3 - 3) {
|
||||||
|
f_rhs[p] += sfz * d12dz *
|
||||||
|
( fh[idx_fh_F(iF, jF, kF - 2, ex)]
|
||||||
|
-EIT * fh[idx_fh_F(iF, jF, kF - 1, ex)]
|
||||||
|
+EIT * fh[idx_fh_F(iF, jF, kF + 1, ex)]
|
||||||
|
- fh[idx_fh_F(iF, jF, kF + 2, ex)]);
|
||||||
|
} else if (k0 <= ex3 - 2) {
|
||||||
|
f_rhs[p] -= sfz * d12dz *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF, kF + 1, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF, kF , ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF, kF - 1, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF, kF - 2, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF, kF - 3, ex)]);
|
||||||
|
}
|
||||||
|
} else if (sfz < ZEO) {
|
||||||
|
if ((k0 - 2) >= kminF) {
|
||||||
|
f_rhs[p] -= sfz * d12dz *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF, kF + 1, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF, kF , ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF, kF - 1, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF, kF - 2, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF, kF - 3, ex)]);
|
||||||
|
} else if ((k0 - 1) >= kminF) {
|
||||||
|
f_rhs[p] += sfz * d12dz *
|
||||||
|
( fh[idx_fh_F(iF, jF, kF - 2, ex)]
|
||||||
|
-EIT * fh[idx_fh_F(iF, jF, kF - 1, ex)]
|
||||||
|
+EIT * fh[idx_fh_F(iF, jF, kF + 1, ex)]
|
||||||
|
- fh[idx_fh_F(iF, jF, kF + 2, ex)]);
|
||||||
|
} else if (k0 >= kminF) {
|
||||||
|
f_rhs[p] += sfz * d12dz *
|
||||||
|
(-F3 * fh[idx_fh_F(iF, jF, kF - 1, ex)]
|
||||||
|
-F10 * fh[idx_fh_F(iF, jF, kF , ex)]
|
||||||
|
+F18 * fh[idx_fh_F(iF, jF, kF + 1, ex)]
|
||||||
|
-F6 * fh[idx_fh_F(iF, jF, kF + 2, ex)]
|
||||||
|
+ fh[idx_fh_F(iF, jF, kF + 3, ex)]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// KO dissipation (same domain restriction as kodiss_c.C)
|
||||||
|
if (eps > ZEO) {
|
||||||
|
const int i0_lo = (iminF + 2 > 0) ? iminF + 2 : 0;
|
||||||
|
const int j0_lo = (jminF + 2 > 0) ? jminF + 2 : 0;
|
||||||
|
const int k0_lo = (kminF + 2 > 0) ? kminF + 2 : 0;
|
||||||
|
const int i0_hi = imaxF - 4; // inclusive
|
||||||
|
const int j0_hi = jmaxF - 4;
|
||||||
|
const int k0_hi = kmaxF - 4;
|
||||||
|
|
||||||
|
if (!(i0_lo > i0_hi || j0_lo > j0_hi || k0_lo > k0_hi)) {
|
||||||
|
for (int k0 = k0_lo; k0 <= k0_hi; ++k0) {
|
||||||
|
const int kF = k0 + 1;
|
||||||
|
for (int j0 = j0_lo; j0 <= j0_hi; ++j0) {
|
||||||
|
const int jF = j0 + 1;
|
||||||
|
for (int i0 = i0_lo; i0 <= i0_hi; ++i0) {
|
||||||
|
const int iF = i0 + 1;
|
||||||
|
const size_t p = idx_ex(i0, j0, k0, ex);
|
||||||
|
|
||||||
|
const double Dx_term =
|
||||||
|
((fh[idx_fh_F(iF - 3, jF, kF, ex)] + fh[idx_fh_F(iF + 3, jF, kF, ex)]) -
|
||||||
|
SIX * (fh[idx_fh_F(iF - 2, jF, kF, ex)] + fh[idx_fh_F(iF + 2, jF, kF, ex)]) +
|
||||||
|
FIT * (fh[idx_fh_F(iF - 1, jF, kF, ex)] + fh[idx_fh_F(iF + 1, jF, kF, ex)]) -
|
||||||
|
TWT * fh[idx_fh_F(iF, jF, kF, ex)]) / dX;
|
||||||
|
|
||||||
|
const double Dy_term =
|
||||||
|
((fh[idx_fh_F(iF, jF - 3, kF, ex)] + fh[idx_fh_F(iF, jF + 3, kF, ex)]) -
|
||||||
|
SIX * (fh[idx_fh_F(iF, jF - 2, kF, ex)] + fh[idx_fh_F(iF, jF + 2, kF, ex)]) +
|
||||||
|
FIT * (fh[idx_fh_F(iF, jF - 1, kF, ex)] + fh[idx_fh_F(iF, jF + 1, kF, ex)]) -
|
||||||
|
TWT * fh[idx_fh_F(iF, jF, kF, ex)]) / dY;
|
||||||
|
|
||||||
|
const double Dz_term =
|
||||||
|
((fh[idx_fh_F(iF, jF, kF - 3, ex)] + fh[idx_fh_F(iF, jF, kF + 3, ex)]) -
|
||||||
|
SIX * (fh[idx_fh_F(iF, jF, kF - 2, ex)] + fh[idx_fh_F(iF, jF, kF + 2, ex)]) +
|
||||||
|
FIT * (fh[idx_fh_F(iF, jF, kF - 1, ex)] + fh[idx_fh_F(iF, jF, kF + 1, ex)]) -
|
||||||
|
TWT * fh[idx_fh_F(iF, jF, kF, ex)]) / dZ;
|
||||||
|
|
||||||
|
f_rhs[p] += (eps / cof) * (Dx_term + Dy_term + Dz_term);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
free(fh);
|
||||||
|
}
|
||||||
@@ -29,6 +29,16 @@
|
|||||||
|
|
||||||
#define REGLEV 0
|
#define REGLEV 0
|
||||||
|
|
||||||
|
#define BSSN_FINE_TIMING 0
|
||||||
|
|
||||||
|
#define BSSN_FINE_TIMING_EVERY 1
|
||||||
|
|
||||||
|
#define BSSN_FINE_TIMING_TOPN 8
|
||||||
|
|
||||||
|
#define BSSN_KERNEL_FINE_TIMING 0
|
||||||
|
|
||||||
|
#define BSSN_ENABLE_STDIN_ABORT_POLL 0
|
||||||
|
|
||||||
//#define USE_GPU
|
//#define USE_GPU
|
||||||
|
|
||||||
//#define CHECKDETAIL
|
//#define CHECKDETAIL
|
||||||
@@ -88,6 +98,21 @@
|
|||||||
// 0: for every level;
|
// 0: for every level;
|
||||||
// 1: for all
|
// 1: for all
|
||||||
//
|
//
|
||||||
|
// define BSSN_FINE_TIMING
|
||||||
|
// enable fine-grained per-timestep timing monitor
|
||||||
|
//
|
||||||
|
// define BSSN_FINE_TIMING_EVERY
|
||||||
|
// report timing every N coarse timesteps
|
||||||
|
//
|
||||||
|
// define BSSN_FINE_TIMING_TOPN
|
||||||
|
// number of hottest timing buckets shown in stdout
|
||||||
|
//
|
||||||
|
// define BSSN_KERNEL_FINE_TIMING
|
||||||
|
// enable split timing inside compute_rhs_bssn
|
||||||
|
//
|
||||||
|
// define BSSN_ENABLE_STDIN_ABORT_POLL
|
||||||
|
// poll stdin and broadcast abort flag every coarse step
|
||||||
|
//
|
||||||
// define USE_GPU
|
// define USE_GPU
|
||||||
// use gpu or not
|
// use gpu or not
|
||||||
//
|
//
|
||||||
@@ -142,4 +167,3 @@
|
|||||||
#define TINY 1e-10
|
#define TINY 1e-10
|
||||||
|
|
||||||
#endif /* MICRODEF_H */
|
#endif /* MICRODEF_H */
|
||||||
|
|
||||||
|
|||||||
@@ -1,172 +1,208 @@
|
|||||||
|
|
||||||
|
|
||||||
include makefile.inc
|
include makefile.inc
|
||||||
|
|
||||||
## ABE build flags selected by PGO_MODE (set in makefile.inc, default: opt)
|
-include AMSS_NCKU_build.mk
|
||||||
## make -> opt (PGO-guided, maximum performance)
|
|
||||||
## make PGO_MODE=instrument -> instrument (Phase 1: collect fresh profile data)
|
ABE_TYPE ?= $(shell awk '/^[[:space:]]*\#define[[:space:]]+ABEtype/ {print $$3; exit}' macrodef.h 2>/dev/null)
|
||||||
PROFDATA = /home/$(shell whoami)/AMSS-NCKU/pgo_profile/default.profdata
|
|
||||||
|
ifeq ($(USE_TRANSFER_CACHE),auto)
|
||||||
ifeq ($(PGO_MODE),instrument)
|
ifeq ($(ABE_TYPE),0)
|
||||||
## Phase 1: instrumentation — omit -ipo/-fp-model fast=2 for faster build and numerical stability
|
EFFECTIVE_USE_TRANSFER_CACHE = 1
|
||||||
CXXAPPFLAGS = -O3 -xHost -fma -fprofile-instr-generate -ipo \
|
else
|
||||||
-Dfortran3 -Dnewc -I${MKLROOT}/include $(INTERP_LB_FLAGS)
|
EFFECTIVE_USE_TRANSFER_CACHE = 0
|
||||||
f90appflags = -O3 -xHost -fma -fprofile-instr-generate -ipo \
|
endif
|
||||||
-align array64byte -fpp -I${MKLROOT}/include
|
else
|
||||||
else
|
EFFECTIVE_USE_TRANSFER_CACHE = $(USE_TRANSFER_CACHE)
|
||||||
## opt (default): maximum performance with PGO profile data
|
endif
|
||||||
CXXAPPFLAGS = -O3 -xHost -fp-model fast=2 -fma -ipo \
|
|
||||||
-fprofile-instr-use=$(PROFDATA) \
|
ifeq ($(USE_CXX_ESCALAR_KERNEL),1)
|
||||||
-Dfortran3 -Dnewc -I${MKLROOT}/include $(INTERP_LB_FLAGS)
|
ifeq ($(ABE_TYPE),1)
|
||||||
f90appflags = -O3 -xHost -fp-model fast=2 -fma -ipo \
|
EFFECTIVE_USE_CXX_ESCALAR_KERNEL = 1
|
||||||
-fprofile-instr-use=$(PROFDATA) \
|
else
|
||||||
-align array64byte -fpp -I${MKLROOT}/include
|
EFFECTIVE_USE_CXX_ESCALAR_KERNEL = 0
|
||||||
endif
|
endif
|
||||||
|
else
|
||||||
.SUFFIXES: .o .f90 .C .for .cu
|
EFFECTIVE_USE_CXX_ESCALAR_KERNEL = 0
|
||||||
|
endif
|
||||||
.f90.o:
|
|
||||||
$(f90) $(f90appflags) -c $< -o $@
|
ifeq ($(EFFECTIVE_USE_CXX_ESCALAR_KERNEL),1)
|
||||||
|
ifeq ($(USE_CXX_KERNELS),0)
|
||||||
.C.o:
|
$(error USE_CXX_ESCALAR_KERNEL=1 requires USE_CXX_KERNELS=1 because bssn_escalar_rhs_c.C reuses the C BSSN kernel)
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
endif
|
||||||
|
endif
|
||||||
.for.o:
|
|
||||||
$(f77) -c $< -o $@
|
## polint(ordn=6) kernel selector:
|
||||||
|
## 1 (default): barycentric fast path
|
||||||
.cu.o:
|
## 0 : fallback to Neville path
|
||||||
$(Cu) $(CUDA_APP_FLAGS) -c $< -o $@ $(CUDA_LIB_PATH)
|
POLINT6_USE_BARY ?= 1
|
||||||
|
POLINT6_FLAG = -DPOLINT6_USE_BARYCENTRIC=$(POLINT6_USE_BARY)
|
||||||
# C rewrite of BSSN RHS kernel and helpers
|
TRANSFER_CACHE_FLAG = -DBSSN_USE_TRANSFER_CACHE=$(EFFECTIVE_USE_TRANSFER_CACHE)
|
||||||
bssn_rhs_c.o: bssn_rhs_c.C
|
ESCALAR_KERNEL_FLAG = -DBSSN_USE_ESCALAR_C_KERNEL=$(EFFECTIVE_USE_CXX_ESCALAR_KERNEL)
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
|
||||||
|
## AMD AOCC build flags optimized for EPYC Zen 4 (-march=znver4)
|
||||||
fderivs_c.o: fderivs_c.C
|
CXXAPPFLAGS = -O3 -march=znver4 -ffast-math -flto \
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
-Dfortran3 -Dnewc -I$(AOCL_ROOT)/include $(INTERP_LB_FLAGS) \
|
||||||
|
$(TRANSFER_CACHE_FLAG) $(ESCALAR_KERNEL_FLAG)
|
||||||
fdderivs_c.o: fdderivs_c.C
|
f90appflags = -O3 -march=znver4 -ffast-math -flto \
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
-cpp -I$(AOCL_ROOT)/include $(POLINT6_FLAG)
|
||||||
|
|
||||||
kodiss_c.o: kodiss_c.C
|
.SUFFIXES: .o .f90 .C .for .cu
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
|
||||||
|
.f90.o:
|
||||||
lopsided_c.o: lopsided_c.C
|
$(f90) $(f90appflags) -c $< -o $@
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
|
||||||
|
.C.o:
|
||||||
interp_lb_profile.o: interp_lb_profile.C interp_lb_profile.h
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
|
||||||
|
.for.o:
|
||||||
## TwoPunctureABE uses fixed optimal flags with its own PGO profile, independent of CXXAPPFLAGS
|
$(f77) -c $< -o $@
|
||||||
TP_PROFDATA = /home/$(shell whoami)/AMSS-NCKU/pgo_profile/TwoPunctureABE.profdata
|
|
||||||
TP_OPTFLAGS = -O3 -xHost -fp-model fast=2 -fma -ipo \
|
.cu.o:
|
||||||
-fprofile-instr-use=$(TP_PROFDATA) \
|
$(Cu) $(CUDA_APP_FLAGS) -c $< -o $@ $(CUDA_LIB_PATH)
|
||||||
-Dfortran3 -Dnewc -I${MKLROOT}/include
|
|
||||||
|
# C rewrite of BSSN RHS kernel and helpers
|
||||||
TwoPunctures.o: TwoPunctures.C
|
bssn_rhs_c.o: bssn_rhs_c.C
|
||||||
${CXX} $(TP_OPTFLAGS) -qopenmp -c $< -o $@
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
|
|
||||||
TwoPunctureABE.o: TwoPunctureABE.C
|
fderivs_c.o: fderivs_c.C
|
||||||
${CXX} $(TP_OPTFLAGS) -qopenmp -c $< -o $@
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
|
|
||||||
# Input files
|
fdderivs_c.o: fdderivs_c.C
|
||||||
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
## Kernel implementation switch (set USE_CXX_KERNELS=0 to fall back to Fortran)
|
|
||||||
ifeq ($(USE_CXX_KERNELS),0)
|
kodiss_c.o: kodiss_c.C
|
||||||
# Fortran mode: no C rewrite files; bssn_rhs.o is included via F90FILES below
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
CFILES =
|
|
||||||
else
|
lopsided_c.o: lopsided_c.C
|
||||||
# C++ mode (default): C rewrite of bssn_rhs and helper kernels
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
CFILES = bssn_rhs_c.o fderivs_c.o fdderivs_c.o kodiss_c.o lopsided_c.o
|
|
||||||
endif
|
lopsided_kodis_c.o: lopsided_kodis_c.C
|
||||||
|
${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
C++FILES = ABE.o Ansorg.o Block.o misc.o monitor.o Parallel.o MPatch.o var.o\
|
|
||||||
cgh.o bssn_class.o surface_integral.o ShellPatch.o\
|
#interp_lb_profile.o: interp_lb_profile.C interp_lb_profile.h
|
||||||
bssnEScalar_class.o perf.o Z4c_class.o NullShellPatch.o\
|
# ${CXX} $(CXXAPPFLAGS) -c $< $(filein) -o $@
|
||||||
bssnEM_class.o cpbc_util.o z4c_rhs_point.o checkpoint.o\
|
|
||||||
Parallel_bam.o scalar_class.o transpbh.o NullShellPatch2.o\
|
## TwoPunctureABE uses fixed optimal flags (AMD AOCC, no PGO)
|
||||||
NullShellPatch2_Evo.o writefile_f.o interp_lb_profile.o
|
TP_OPTFLAGS = -O3 -march=znver4 -ffast-math -flto \
|
||||||
|
-Dfortran3 -Dnewc -I$(AOCL_ROOT)/include
|
||||||
C++FILES_GPU = ABE.o Ansorg.o Block.o misc.o monitor.o Parallel.o MPatch.o var.o\
|
|
||||||
cgh.o surface_integral.o ShellPatch.o\
|
TwoPunctures.o: TwoPunctures.C
|
||||||
bssnEScalar_class.o perf.o Z4c_class.o NullShellPatch.o\
|
${CXX} $(TP_OPTFLAGS) -fopenmp -c $< -o $@
|
||||||
bssnEM_class.o cpbc_util.o z4c_rhs_point.o checkpoint.o\
|
|
||||||
Parallel_bam.o scalar_class.o transpbh.o NullShellPatch2.o\
|
TwoPunctureABE.o: TwoPunctureABE.C
|
||||||
NullShellPatch2_Evo.o \
|
${CXX} $(TP_OPTFLAGS) -fopenmp -c $< -o $@
|
||||||
bssn_gpu_class.o bssn_step_gpu.o bssn_macro.o writefile_f.o
|
|
||||||
|
# Input files
|
||||||
F90FILES_BASE = enforce_algebra.o fmisc.o initial_puncture.o prolongrestrict.o\
|
|
||||||
prolongrestrict_cell.o prolongrestrict_vertex.o\
|
## Kernel implementation switch (set USE_CXX_KERNELS=0 to fall back to Fortran)
|
||||||
rungekutta4_rout.o diff_new.o kodiss.o kodiss_sh.o\
|
ifeq ($(USE_CXX_KERNELS),0)
|
||||||
lopsidediff.o sommerfeld_rout.o getnp4.o diff_new_sh.o\
|
# Fortran mode: no C rewrite files; bssn_rhs.o is included via F90FILES below
|
||||||
shellfunctions.o bssn_rhs_ss.o Set_Rho_ADM.o\
|
CFILES =
|
||||||
getnp4EScalar.o bssnEScalar_rhs.o bssn_constraint.o ricci_gamma.o\
|
else
|
||||||
fadmquantites_bssn.o Z4c_rhs.o Z4c_rhs_ss.o point_diff_new_sh.o\
|
# C++ mode (default): C rewrite of bssn/bssn-escalar rhs and helper kernels
|
||||||
cpbc.o getnp4old.o NullEvol.o initial_null.o initial_maxwell.o\
|
CFILES = bssn_rhs_c.o fderivs_c.o fdderivs_c.o kodiss_c.o lopsided_c.o lopsided_kodis_c.o
|
||||||
getnpem2.o empart.o NullNews.o fourdcurvature.o\
|
ifeq ($(EFFECTIVE_USE_CXX_ESCALAR_KERNEL),1)
|
||||||
bssn2adm.o adm_constraint.o adm_ricci_gamma.o\
|
CFILES += bssn_escalar_rhs_c.o
|
||||||
scalar_rhs.o initial_scalar.o NullEvol2.o initial_null2.o\
|
endif
|
||||||
NullNews2.o tool_f.o
|
endif
|
||||||
|
|
||||||
ifeq ($(USE_CXX_KERNELS),0)
|
## RK4 kernel switch (independent from USE_CXX_KERNELS)
|
||||||
# Fortran mode: include original bssn_rhs.o
|
ifeq ($(USE_CXX_RK4),1)
|
||||||
F90FILES = $(F90FILES_BASE) bssn_rhs.o
|
CFILES += rungekutta4_rout_c.o
|
||||||
else
|
RK4_F90_OBJ =
|
||||||
# C++ mode (default): bssn_rhs.o replaced by C++ kernel
|
else
|
||||||
F90FILES = $(F90FILES_BASE)
|
RK4_F90_OBJ = rungekutta4_rout.o
|
||||||
endif
|
endif
|
||||||
|
|
||||||
F77FILES = zbesh.o
|
C++FILES = ABE.o Ansorg.o Block.o misc.o monitor.o Parallel.o MPatch.o var.o\
|
||||||
|
cgh.o bssn_class.o surface_integral.o ShellPatch.o\
|
||||||
AHFDOBJS = expansion.o expansion_Jacobian.o patch.o coords.o patch_info.o patch_interp.o patch_system.o \
|
bssnEScalar_class.o perf.o Z4c_class.o NullShellPatch.o\
|
||||||
tgrid.o fd_grid.o ghost_zone.o array.o round.o norm.o fuzzy.o error_exit.o miscfp.o \
|
bssnEM_class.o cpbc_util.o z4c_rhs_point.o checkpoint.o\
|
||||||
linear_map.o cpm_map.o BH_diagnostics.o setup.o horizon_sequence.o find_horizons.o \
|
Parallel_bam.o scalar_class.o transpbh.o NullShellPatch2.o\
|
||||||
initial_guess.o Newton.o Jacobian.o ilucg.o IntPnts0.o IntPnts.o
|
NullShellPatch2_Evo.o writefile_f.o interp_lb_profile.o
|
||||||
|
|
||||||
TwoPunctureFILES = TwoPunctureABE.o TwoPunctures.o
|
C++FILES_GPU = ABE.o Ansorg.o Block.o misc.o monitor.o Parallel.o MPatch.o var.o\
|
||||||
|
cgh.o surface_integral.o ShellPatch.o\
|
||||||
CUDAFILES = bssn_gpu.o bssn_gpu_rhs_ss.o
|
bssnEScalar_class.o perf.o Z4c_class.o NullShellPatch.o\
|
||||||
|
bssnEM_class.o cpbc_util.o z4c_rhs_point.o checkpoint.o\
|
||||||
# file dependences
|
Parallel_bam.o scalar_class.o transpbh.o NullShellPatch2.o\
|
||||||
$(C++FILES) $(C++FILES_GPU) $(F90FILES) $(CFILES) $(AHFDOBJS) $(CUDAFILES): macrodef.fh
|
NullShellPatch2_Evo.o \
|
||||||
|
bssn_gpu_class.o bssn_step_gpu.o bssn_macro.o writefile_f.o
|
||||||
$(C++FILES): Block.h enforce_algebra.h fmisc.h initial_puncture.h macrodef.h\
|
|
||||||
misc.h monitor.h MyList.h Parallel.h MPatch.h prolongrestrict.h\
|
F90FILES_BASE = enforce_algebra.o fmisc.o initial_puncture.o prolongrestrict.o\
|
||||||
rungekutta4_rout.h var.h bssn_class.h bssn_rhs.h sommerfeld_rout.h\
|
prolongrestrict_cell.o prolongrestrict_vertex.o\
|
||||||
cgh.h surface_integral.h ShellPatch.h shellfunctions.h perf.h\
|
$(RK4_F90_OBJ) diff_new.o kodiss.o kodiss_sh.o\
|
||||||
fadmquantites_bssn.h cpbc.h getnp4.h initial_null.h NullEvol.h\
|
lopsidediff.o sommerfeld_rout.o getnp4.o diff_new_sh.o\
|
||||||
NullShellPatch.h initial_maxwell.h bssnEM_class.h getnpem2.h\
|
shellfunctions.o bssn_rhs_ss.o Set_Rho_ADM.o\
|
||||||
empart.h NullNews.h kodiss.h Parallel_bam.h ricci_gamma.h\
|
getnp4EScalar.o bssnEScalar_rhs.o bssn_constraint.o ricci_gamma.o\
|
||||||
initial_null2.h NullShellPatch2.h
|
fadmquantites_bssn.o Z4c_rhs.o Z4c_rhs_ss.o point_diff_new_sh.o\
|
||||||
|
cpbc.o getnp4old.o NullEvol.o initial_null.o initial_maxwell.o\
|
||||||
$(C++FILES_GPU): Block.h enforce_algebra.h fmisc.h initial_puncture.h macrodef.h\
|
getnpem2.o empart.o NullNews.o fourdcurvature.o\
|
||||||
misc.h monitor.h MyList.h Parallel.h MPatch.h prolongrestrict.h\
|
bssn2adm.o adm_constraint.o adm_ricci_gamma.o\
|
||||||
rungekutta4_rout.h var.h bssn_rhs.h sommerfeld_rout.h\
|
scalar_rhs.o initial_scalar.o NullEvol2.o initial_null2.o\
|
||||||
cgh.h surface_integral.h ShellPatch.h shellfunctions.h perf.h\
|
NullNews2.o tool_f.o
|
||||||
fadmquantites_bssn.h cpbc.h getnp4.h initial_null.h NullEvol.h\
|
|
||||||
NullShellPatch.h initial_maxwell.h bssnEM_class.h getnpem2.h\
|
ifeq ($(USE_CXX_KERNELS),0)
|
||||||
empart.h NullNews.h kodiss.h Parallel_bam.h ricci_gamma.h\
|
# Fortran mode: include original bssn_rhs.o
|
||||||
initial_null2.h NullShellPatch2.h \
|
F90FILES = $(F90FILES_BASE) bssn_rhs.o
|
||||||
bssn_gpu_class.h bssn_macro.h
|
else
|
||||||
|
# C++ mode (default): bssn_rhs.o replaced by C++ kernel
|
||||||
$(AHFDOBJS): cctk.h cctk_Config.h cctk_Types.h cctk_Constants.h myglobal.h
|
F90FILES = $(F90FILES_BASE)
|
||||||
|
endif
|
||||||
$(C++FILES) $(C++FILES_GPU) $(CFILES) $(AHFDOBJS) $(CUDAFILES): macrodef.h
|
|
||||||
|
F77FILES = zbesh.o
|
||||||
TwoPunctureFILES: TwoPunctures.h
|
|
||||||
|
AHFDOBJS = expansion.o expansion_Jacobian.o patch.o coords.o patch_info.o patch_interp.o patch_system.o \
|
||||||
$(CUDAFILES): bssn_gpu.h gpu_mem.h gpu_rhsSS_mem.h
|
tgrid.o fd_grid.o ghost_zone.o array.o round.o norm.o fuzzy.o error_exit.o miscfp.o \
|
||||||
|
linear_map.o cpm_map.o BH_diagnostics.o setup.o horizon_sequence.o find_horizons.o \
|
||||||
misc.o : zbesh.o
|
initial_guess.o Newton.o Jacobian.o ilucg.o IntPnts0.o IntPnts.o
|
||||||
|
|
||||||
# projects
|
TwoPunctureFILES = TwoPunctureABE.o TwoPunctures.o
|
||||||
ABE: $(C++FILES) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS)
|
|
||||||
$(CLINKER) $(CXXAPPFLAGS) -o $@ $(C++FILES) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS) $(LDLIBS)
|
CUDAFILES = bssn_gpu.o bssn_gpu_rhs_ss.o
|
||||||
|
|
||||||
ABEGPU: $(C++FILES_GPU) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS) $(CUDAFILES)
|
# file dependences
|
||||||
$(CLINKER) $(CXXAPPFLAGS) -o $@ $(C++FILES_GPU) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS) $(CUDAFILES) $(LDLIBS)
|
$(C++FILES) $(C++FILES_GPU) $(F90FILES) $(CFILES) $(AHFDOBJS) $(CUDAFILES): macrodef.fh
|
||||||
|
|
||||||
TwoPunctureABE: $(TwoPunctureFILES)
|
$(C++FILES): Block.h enforce_algebra.h fmisc.h initial_puncture.h macrodef.h\
|
||||||
$(CLINKER) $(TP_OPTFLAGS) -qopenmp -o $@ $(TwoPunctureFILES) $(LDLIBS)
|
misc.h monitor.h MyList.h Parallel.h MPatch.h prolongrestrict.h\
|
||||||
|
rungekutta4_rout.h var.h bssn_class.h bssn_rhs.h sommerfeld_rout.h\
|
||||||
clean:
|
cgh.h surface_integral.h ShellPatch.h shellfunctions.h perf.h\
|
||||||
rm *.o ABE ABEGPU TwoPunctureABE make.log -f
|
fadmquantites_bssn.h cpbc.h getnp4.h initial_null.h NullEvol.h\
|
||||||
|
NullShellPatch.h initial_maxwell.h bssnEM_class.h getnpem2.h\
|
||||||
|
empart.h NullNews.h kodiss.h Parallel_bam.h ricci_gamma.h\
|
||||||
|
initial_null2.h NullShellPatch2.h
|
||||||
|
|
||||||
|
$(C++FILES_GPU): Block.h enforce_algebra.h fmisc.h initial_puncture.h macrodef.h\
|
||||||
|
misc.h monitor.h MyList.h Parallel.h MPatch.h prolongrestrict.h\
|
||||||
|
rungekutta4_rout.h var.h bssn_rhs.h sommerfeld_rout.h\
|
||||||
|
cgh.h surface_integral.h ShellPatch.h shellfunctions.h perf.h\
|
||||||
|
fadmquantites_bssn.h cpbc.h getnp4.h initial_null.h NullEvol.h\
|
||||||
|
NullShellPatch.h initial_maxwell.h bssnEM_class.h getnpem2.h\
|
||||||
|
empart.h NullNews.h kodiss.h Parallel_bam.h ricci_gamma.h\
|
||||||
|
initial_null2.h NullShellPatch2.h \
|
||||||
|
bssn_gpu_class.h bssn_macro.h
|
||||||
|
|
||||||
|
$(AHFDOBJS): cctk.h cctk_Config.h cctk_Types.h cctk_Constants.h myglobal.h
|
||||||
|
|
||||||
|
$(C++FILES) $(C++FILES_GPU) $(CFILES) $(AHFDOBJS) $(CUDAFILES): macrodef.h
|
||||||
|
|
||||||
|
TwoPunctureFILES: TwoPunctures.h
|
||||||
|
|
||||||
|
$(CUDAFILES): bssn_gpu.h gpu_mem.h gpu_rhsSS_mem.h
|
||||||
|
|
||||||
|
misc.o : zbesh.o
|
||||||
|
|
||||||
|
# projects
|
||||||
|
ABE: $(C++FILES) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS)
|
||||||
|
$(CLINKER) $(CXXAPPFLAGS) -o $@ $(C++FILES) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS) $(LDLIBS)
|
||||||
|
|
||||||
|
ABEGPU: $(C++FILES_GPU) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS) $(CUDAFILES)
|
||||||
|
$(CLINKER) $(CXXAPPFLAGS) -o $@ $(C++FILES_GPU) $(CFILES) $(F90FILES) $(F77FILES) $(AHFDOBJS) $(CUDAFILES) $(LDLIBS)
|
||||||
|
|
||||||
|
TwoPunctureABE: $(TwoPunctureFILES)
|
||||||
|
$(CLINKER) $(TP_OPTFLAGS) -fopenmp -o $@ $(TwoPunctureFILES) $(LDLIBS)
|
||||||
|
|
||||||
|
clean:
|
||||||
|
rm *.o ABE ABEGPU TwoPunctureABE make.log -f
|
||||||
|
|||||||
@@ -1,19 +1,17 @@
|
|||||||
## GCC version (commented out)
|
## AMD AOCC version with AOCL (Optimized for AMD EPYC Zen 4)
|
||||||
## filein = -I/usr/include -I/usr/lib/x86_64-linux-gnu/mpich/include -I/usr/lib/x86_64-linux-gnu/openmpi/lib/ -I/usr/lib/gcc/x86_64-linux-gnu/11/ -I/usr/include/c++/11/
|
|
||||||
## filein = -I/usr/include/ -I/usr/include/openmpi-x86_64/ -I/usr/lib/x86_64-linux-gnu/openmpi/include/ -I/usr/lib/x86_64-linux-gnu/openmpi/lib/ -I/usr/lib/gcc/x86_64-linux-gnu/11/ -I/usr/include/c++/11/
|
|
||||||
## LDLIBS = -L/usr/lib/x86_64-linux-gnu -L/usr/lib64 -L/usr/lib/gcc/x86_64-linux-gnu/11 -lgfortran -lmpi -lgfortran
|
|
||||||
|
|
||||||
## Intel oneAPI version with oneMKL (Optimized for performance)
|
## AOCL root path for includes and libraries
|
||||||
filein = -I/usr/include/ -I${MKLROOT}/include
|
AOCL_ROOT ?= /home/gh0s7/AOCC/aocl/5.2.0/aocc
|
||||||
|
|
||||||
## Using sequential MKL (OpenMP disabled for better single-threaded performance)
|
## AOCC-built OpenMPI prefix
|
||||||
## Added -lifcore for Intel Fortran runtime and -limf for Intel math library
|
OMPI_PREFIX ?= /home/gh0s7/AOCC/aocc-openmpi
|
||||||
LDLIBS = -L${MKLROOT}/lib -lmkl_intel_lp64 -lmkl_sequential -lmkl_core -lifcore -limf -lpthread -lm -ldl -liomp5
|
|
||||||
|
|
||||||
## PGO build mode switch (ABE only; TwoPunctureABE always uses opt flags)
|
filein = -I/usr/include/ -I$(AOCL_ROOT)/include
|
||||||
## opt : (default) maximum performance with PGO profile-guided optimization
|
|
||||||
## instrument : PGO Phase 1 instrumentation to collect fresh profile data
|
## Using AOCL BLIS + libFLAME for BLAS/LAPACK
|
||||||
PGO_MODE ?= opt
|
## AOCC Fortran runtime: -lflang (includes FortranRuntime)
|
||||||
|
## AOCC OpenMP runtime: -lomp (LLVM OpenMP)
|
||||||
|
LDLIBS = -L$(AOCL_ROOT)/lib -lblis -lflame -lamdlibm -lflang -lpgmath -lpthread -lm -ldl -lomp
|
||||||
|
|
||||||
## Interp_Points load balance profiling mode
|
## Interp_Points load balance profiling mode
|
||||||
## off : (default) no load balance instrumentation
|
## off : (default) no load balance instrumentation
|
||||||
@@ -33,11 +31,29 @@ endif
|
|||||||
## 1 (default) : use C++ rewrite of bssn_rhs and helper kernels (faster)
|
## 1 (default) : use C++ rewrite of bssn_rhs and helper kernels (faster)
|
||||||
## 0 : fall back to original Fortran kernels
|
## 0 : fall back to original Fortran kernels
|
||||||
USE_CXX_KERNELS ?= 1
|
USE_CXX_KERNELS ?= 1
|
||||||
f90 = ifx
|
|
||||||
f77 = ifx
|
## BSSN-EScalar RHS switch
|
||||||
CXX = icpx
|
## 1 (default) : use BSSN-EScalar C wrapper on the normal patch path
|
||||||
CC = icx
|
## 0 : keep the original Fortran BSSN-EScalar RHS for precision-safe runs
|
||||||
CLINKER = mpiicpx
|
## Note: this requires USE_CXX_KERNELS=1 because the wrapper reuses the C BSSN kernel.
|
||||||
|
USE_CXX_ESCALAR_KERNEL ?= 1
|
||||||
|
|
||||||
|
## Cached transfer switch
|
||||||
|
## auto (default): enable for BSSN vacuum, keep other paths on the safe uncached path
|
||||||
|
## 1 : force cached Sync/Restrict/OutBd transfer on evolution hot paths
|
||||||
|
## 0 : force the original uncached transfer path
|
||||||
|
USE_TRANSFER_CACHE ?= auto
|
||||||
|
|
||||||
|
## RK4 kernel implementation switch
|
||||||
|
## 1 (default) : use C/C++ rewrite of rungekutta4_rout (for optimization experiments)
|
||||||
|
## 0 : use original Fortran rungekutta4_rout.o
|
||||||
|
USE_CXX_RK4 ?= 1
|
||||||
|
|
||||||
|
f90 = flang
|
||||||
|
f77 = flang
|
||||||
|
CXX = clang++
|
||||||
|
CC = clang
|
||||||
|
CLINKER = $(OMPI_PREFIX)/bin/mpicxx
|
||||||
|
|
||||||
Cu = nvcc
|
Cu = nvcc
|
||||||
CUDA_LIB_PATH = -L/usr/lib/cuda/lib64 -I/usr/include -I/usr/lib/cuda/include
|
CUDA_LIB_PATH = -L/usr/lib/cuda/lib64 -I/usr/include -I/usr/lib/cuda/include
|
||||||
|
|||||||
@@ -1934,18 +1934,35 @@
|
|||||||
! when if=1 -> ic=0, this is different to vertex center grid
|
! when if=1 -> ic=0, this is different to vertex center grid
|
||||||
real*8, dimension(-2:extc(1),-2:extc(2),-2:extc(3)) :: funcc
|
real*8, dimension(-2:extc(1),-2:extc(2),-2:extc(3)) :: funcc
|
||||||
integer,dimension(3) :: cxI
|
integer,dimension(3) :: cxI
|
||||||
integer :: i,j,k,ii,jj,kk
|
integer :: i,j,k,ii,jj,kk,px,py,pz
|
||||||
real*8, dimension(6,6) :: tmp2
|
real*8, dimension(6,6) :: tmp2
|
||||||
real*8, dimension(6) :: tmp1
|
real*8, dimension(6) :: tmp1
|
||||||
|
integer, dimension(extf(1)) :: cix
|
||||||
|
integer, dimension(extf(2)) :: ciy
|
||||||
|
integer, dimension(extf(3)) :: ciz
|
||||||
|
integer, dimension(extf(1)) :: pix
|
||||||
|
integer, dimension(extf(2)) :: piy
|
||||||
|
integer, dimension(extf(3)) :: piz
|
||||||
|
|
||||||
real*8, parameter :: C1=7.7d1/8.192d3,C2=-6.93d2/8.192d3,C3=3.465d3/4.096d3
|
real*8, parameter :: C1=7.7d1/8.192d3,C2=-6.93d2/8.192d3,C3=3.465d3/4.096d3
|
||||||
real*8, parameter :: C6=6.3d1/8.192d3,C5=-4.95d2/8.192d3,C4=1.155d3/4.096d3
|
real*8, parameter :: C6=6.3d1/8.192d3,C5=-4.95d2/8.192d3,C4=1.155d3/4.096d3
|
||||||
|
real*8, dimension(6,2), parameter :: WC = reshape((/&
|
||||||
|
C1,C2,C3,C4,C5,C6,&
|
||||||
|
C6,C5,C4,C3,C2,C1/), (/6,2/))
|
||||||
|
|
||||||
integer::imini,imaxi,jmini,jmaxi,kmini,kmaxi
|
integer::imini,imaxi,jmini,jmaxi,kmini,kmaxi
|
||||||
integer::imino,imaxo,jmino,jmaxo,kmino,kmaxo
|
integer::imino,imaxo,jmino,jmaxo,kmino,kmaxo
|
||||||
|
integer::maxcx,maxcy,maxcz
|
||||||
|
|
||||||
real*8,dimension(3) :: CD,FD
|
real*8,dimension(3) :: CD,FD
|
||||||
|
real*8 :: tmp_yz(extc(1), 6) ! 存储整条 X 线上 6 个 Y 轴偏置的 Z 向插值结果
|
||||||
|
real*8 :: tmp_xyz_line(-2:extc(1)) ! 包含 X 向 6 点模板访问所需下界
|
||||||
|
real*8 :: v1, v2, v3, v4, v5, v6
|
||||||
|
integer :: ic, jc, kc, ix_offset,ix,iy,iz,jc_min,jc_max,ic_min,ic_max,kc_min,kc_max
|
||||||
|
integer :: i_lo, i_hi, j_lo, j_hi, k_lo, k_hi
|
||||||
|
logical :: need_full_symmetry
|
||||||
|
real*8 :: res_line
|
||||||
|
real*8 :: tmp_z_slab(-2:extc(1), -2:extc(2)) ! 包含 Y/X 向模板访问所需下界
|
||||||
if(wei.ne.3)then
|
if(wei.ne.3)then
|
||||||
write(*,*)"prolongrestrict.f90::prolong3: this routine only surport 3 dimension"
|
write(*,*)"prolongrestrict.f90::prolong3: this routine only surport 3 dimension"
|
||||||
write(*,*)"dim = ",wei
|
write(*,*)"dim = ",wei
|
||||||
@@ -2020,145 +2037,140 @@
|
|||||||
return
|
return
|
||||||
endif
|
endif
|
||||||
|
|
||||||
call symmetry_bd(3,extc,func,funcc,SoA)
|
do i = imino,imaxo
|
||||||
|
ii = i + lbf(1) - 1
|
||||||
!~~~~~~> prolongation start...
|
cix(i) = ii/2 - lbc(1) + 1
|
||||||
|
if(ii/2*2 == ii)then
|
||||||
|
pix(i) = 1
|
||||||
|
else
|
||||||
|
pix(i) = 2
|
||||||
|
endif
|
||||||
|
enddo
|
||||||
|
do j = jmino,jmaxo
|
||||||
|
jj = j + lbf(2) - 1
|
||||||
|
ciy(j) = jj/2 - lbc(2) + 1
|
||||||
|
if(jj/2*2 == jj)then
|
||||||
|
piy(j) = 1
|
||||||
|
else
|
||||||
|
piy(j) = 2
|
||||||
|
endif
|
||||||
|
enddo
|
||||||
do k = kmino,kmaxo
|
do k = kmino,kmaxo
|
||||||
do j = jmino,jmaxo
|
kk = k + lbf(3) - 1
|
||||||
do i = imino,imaxo
|
ciz(k) = kk/2 - lbc(3) + 1
|
||||||
cxI(1) = i
|
if(kk/2*2 == kk)then
|
||||||
cxI(2) = j
|
piz(k) = 1
|
||||||
cxI(3) = k
|
else
|
||||||
! change to coarse level reference
|
piz(k) = 2
|
||||||
!|---*--- ---*--- ---*--- ---*--- ---*--- ---*--- ---*--- ---*---|
|
endif
|
||||||
!|=======x===============x===============x===============x=======|
|
|
||||||
cxI = (cxI+lbf-1)/2
|
|
||||||
! change to array index
|
|
||||||
cxI = cxI - lbc + 1
|
|
||||||
|
|
||||||
if(any(cxI+3 > extc)) write(*,*)"error in prolong"
|
|
||||||
ii=i+lbf(1)-1
|
|
||||||
jj=j+lbf(2)-1
|
|
||||||
kk=k+lbf(3)-1
|
|
||||||
#if 0
|
|
||||||
if(ii/2*2==ii)then
|
|
||||||
if(jj/2*2==jj)then
|
|
||||||
if(kk/2*2==kk)then
|
|
||||||
tmp2= C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C1*tmp2(:,1)+C2*tmp2(:,2)+C3*tmp2(:,3)+C4*tmp2(:,4)+C5*tmp2(:,5)+C6*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C1*tmp1(1)+C2*tmp1(2)+C3*tmp1(3)+C4*tmp1(4)+C5*tmp1(5)+C6*tmp1(6)
|
|
||||||
else
|
|
||||||
tmp2= C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C1*tmp2(:,1)+C2*tmp2(:,2)+C3*tmp2(:,3)+C4*tmp2(:,4)+C5*tmp2(:,5)+C6*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C1*tmp1(1)+C2*tmp1(2)+C3*tmp1(3)+C4*tmp1(4)+C5*tmp1(5)+C6*tmp1(6)
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
if(kk/2*2==kk)then
|
|
||||||
tmp2= C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C6*tmp2(:,1)+C5*tmp2(:,2)+C4*tmp2(:,3)+C3*tmp2(:,4)+C2*tmp2(:,5)+C1*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C1*tmp1(1)+C2*tmp1(2)+C3*tmp1(3)+C4*tmp1(4)+C5*tmp1(5)+C6*tmp1(6)
|
|
||||||
else
|
|
||||||
tmp2= C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C6*tmp2(:,1)+C5*tmp2(:,2)+C4*tmp2(:,3)+C3*tmp2(:,4)+C2*tmp2(:,5)+C1*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C1*tmp1(1)+C2*tmp1(2)+C3*tmp1(3)+C4*tmp1(4)+C5*tmp1(5)+C6*tmp1(6)
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
if(jj/2*2==jj)then
|
|
||||||
if(kk/2*2==kk)then
|
|
||||||
tmp2= C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C1*tmp2(:,1)+C2*tmp2(:,2)+C3*tmp2(:,3)+C4*tmp2(:,4)+C5*tmp2(:,5)+C6*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C6*tmp1(1)+C5*tmp1(2)+C4*tmp1(3)+C3*tmp1(4)+C2*tmp1(5)+C1*tmp1(6)
|
|
||||||
else
|
|
||||||
tmp2= C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C1*tmp2(:,1)+C2*tmp2(:,2)+C3*tmp2(:,3)+C4*tmp2(:,4)+C5*tmp2(:,5)+C6*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C6*tmp1(1)+C5*tmp1(2)+C4*tmp1(3)+C3*tmp1(4)+C2*tmp1(5)+C1*tmp1(6)
|
|
||||||
endif
|
|
||||||
else
|
|
||||||
if(kk/2*2==kk)then
|
|
||||||
tmp2= C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C6*tmp2(:,1)+C5*tmp2(:,2)+C4*tmp2(:,3)+C3*tmp2(:,4)+C2*tmp2(:,5)+C1*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C6*tmp1(1)+C5*tmp1(2)+C4*tmp1(3)+C3*tmp1(4)+C2*tmp1(5)+C1*tmp1(6)
|
|
||||||
else
|
|
||||||
tmp2= C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
tmp1= C6*tmp2(:,1)+C5*tmp2(:,2)+C4*tmp2(:,3)+C3*tmp2(:,4)+C2*tmp2(:,5)+C1*tmp2(:,6)
|
|
||||||
funf(i,j,k)= C6*tmp1(1)+C5*tmp1(2)+C4*tmp1(3)+C3*tmp1(4)+C2*tmp1(5)+C1*tmp1(6)
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
endif
|
|
||||||
#else
|
|
||||||
if(kk/2*2==kk)then
|
|
||||||
tmp2= C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
else
|
|
||||||
tmp2= C6*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-2)+&
|
|
||||||
C5*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)-1)+&
|
|
||||||
C4*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3) )+&
|
|
||||||
C3*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+1)+&
|
|
||||||
C2*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+2)+&
|
|
||||||
C1*funcc(cxI(1)-2:cxI(1)+3,cxI(2)-2:cxI(2)+3,cxI(3)+3)
|
|
||||||
endif
|
|
||||||
|
|
||||||
if(jj/2*2==jj)then
|
|
||||||
tmp1= C1*tmp2(:,1)+C2*tmp2(:,2)+C3*tmp2(:,3)+C4*tmp2(:,4)+C5*tmp2(:,5)+C6*tmp2(:,6)
|
|
||||||
else
|
|
||||||
tmp1= C6*tmp2(:,1)+C5*tmp2(:,2)+C4*tmp2(:,3)+C3*tmp2(:,4)+C2*tmp2(:,5)+C1*tmp2(:,6)
|
|
||||||
endif
|
|
||||||
|
|
||||||
if(ii/2*2==ii)then
|
|
||||||
funf(i,j,k)= C1*tmp1(1)+C2*tmp1(2)+C3*tmp1(3)+C4*tmp1(4)+C5*tmp1(5)+C6*tmp1(6)
|
|
||||||
else
|
|
||||||
funf(i,j,k)= C6*tmp1(1)+C5*tmp1(2)+C4*tmp1(3)+C3*tmp1(4)+C2*tmp1(5)+C1*tmp1(6)
|
|
||||||
endif
|
|
||||||
#endif
|
|
||||||
enddo
|
|
||||||
enddo
|
|
||||||
enddo
|
enddo
|
||||||
|
|
||||||
|
ic_min = minval(cix(imino:imaxo))
|
||||||
|
ic_max = maxval(cix(imino:imaxo))
|
||||||
|
jc_min = minval(ciy(jmino:jmaxo))
|
||||||
|
jc_max = maxval(ciy(jmino:jmaxo))
|
||||||
|
kc_min = minval(ciz(kmino:kmaxo))
|
||||||
|
kc_max = maxval(ciz(kmino:kmaxo))
|
||||||
|
|
||||||
|
maxcx = ic_max
|
||||||
|
maxcy = jc_max
|
||||||
|
maxcz = kc_max
|
||||||
|
if(maxcx+3 > extc(1) .or. maxcy+3 > extc(2) .or. maxcz+3 > extc(3))then
|
||||||
|
write(*,*)"error in prolong"
|
||||||
|
return
|
||||||
|
endif
|
||||||
|
|
||||||
|
i_lo = ic_min - 2
|
||||||
|
i_hi = ic_max + 3
|
||||||
|
j_lo = jc_min - 2
|
||||||
|
j_hi = jc_max + 3
|
||||||
|
k_lo = kc_min - 2
|
||||||
|
k_hi = kc_max + 3
|
||||||
|
need_full_symmetry = (i_lo < 1) .or. (j_lo < 1) .or. (k_lo < 1)
|
||||||
|
if(need_full_symmetry)then
|
||||||
|
call symmetry_bd(3,extc,func,funcc,SoA)
|
||||||
|
else
|
||||||
|
funcc(i_lo:i_hi,j_lo:j_hi,k_lo:k_hi) = func(i_lo:i_hi,j_lo:j_hi,k_lo:k_hi)
|
||||||
|
endif
|
||||||
|
|
||||||
|
! 对每个 k(pz, kc 固定)预计算 Z 向插值的 2D 切片
|
||||||
|
|
||||||
|
do k = kmino, kmaxo
|
||||||
|
pz = piz(k); kc = ciz(k)
|
||||||
|
! --- Pass 1: Z 方向,只算一次 ---
|
||||||
|
do iy = jc_min-2, jc_max+3 ! 仅需的 iy 范围(对应 jc-2:jc+3)
|
||||||
|
do ii = ic_min-2, ic_max+3 ! 仅需的 ii 范围(对应 cix-2:cix+3)
|
||||||
|
tmp_z_slab(ii, iy) = sum(WC(:,pz) * funcc(ii, iy, kc-2:kc+3))
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
|
||||||
|
do j = jmino, jmaxo
|
||||||
|
py = piy(j); jc = ciy(j)
|
||||||
|
! --- Pass 2: Y 方向 ---
|
||||||
|
do ii = ic_min-2, ic_max+3
|
||||||
|
tmp_xyz_line(ii) = sum(WC(:,py) * tmp_z_slab(ii, jc-2:jc+3))
|
||||||
|
end do
|
||||||
|
! --- Pass 3: X 方向 ---
|
||||||
|
do i = imino, imaxo
|
||||||
|
funf(i,j,k) = sum(WC(:,pix(i)) * tmp_xyz_line(cix(i)-2:cix(i)+3))
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
|
||||||
|
!~~~~~~> prolongation start...
|
||||||
|
#if 0
|
||||||
|
do k = kmino, kmaxo
|
||||||
|
pz = piz(k)
|
||||||
|
kc = ciz(k)
|
||||||
|
|
||||||
|
do j = jmino, jmaxo
|
||||||
|
py = piy(j)
|
||||||
|
jc = ciy(j)
|
||||||
|
|
||||||
|
! --- 步骤 1 & 2 融合:分段处理 X 轴,提升 Cache 命中率 ---
|
||||||
|
! 我们将 ii 循环逻辑重组,减少对 funcc 的跨行重复访问
|
||||||
|
do ii = 1, extc(1)
|
||||||
|
! 1. 先做 Z 方向的 6 条线插值(针对当前的 ii 和当前的 6 个 iy)
|
||||||
|
! 我们直接在这里把 Y 方向的加权也做了,省去 tmp_yz 数组
|
||||||
|
! 这样 funcc 的数据读进来后立即完成所有维度的贡献,不再写回内存
|
||||||
|
|
||||||
|
res_line = 0.0d0
|
||||||
|
do jj = 1, 6
|
||||||
|
iy = jc - 3 + jj
|
||||||
|
! 这一行代码是核心:一次性完成 Z 插值并加上 Y 的权重
|
||||||
|
! 编译器会把 WC(jj, py) 存在寄存器里
|
||||||
|
res_line = res_line + WC(jj, py) * ( &
|
||||||
|
WC(1, pz) * funcc(ii, iy, kc-2) + &
|
||||||
|
WC(2, pz) * funcc(ii, iy, kc-1) + &
|
||||||
|
WC(3, pz) * funcc(ii, iy, kc ) + &
|
||||||
|
WC(4, pz) * funcc(ii, iy, kc+1) + &
|
||||||
|
WC(5, pz) * funcc(ii, iy, kc+2) + &
|
||||||
|
WC(6, pz) * funcc(ii, iy, kc+3) )
|
||||||
|
end do
|
||||||
|
tmp_xyz_line(ii) = res_line
|
||||||
|
end do
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
! 3. 【降维:X 向】最后在最内层只处理 X 方向的 6 点加权
|
||||||
|
! 此时每个点的计算量从原来的 200+ 次乘法降到了仅 6 次
|
||||||
|
do i = imino, imaxo
|
||||||
|
px = pix(i)
|
||||||
|
ic = cix(i)
|
||||||
|
|
||||||
|
! 直接从预计算好的 line 中读取连续的 6 个点
|
||||||
|
! ic-2 到 ic+3 对应原始 6 点算子
|
||||||
|
funf(i,j,k) = WC(1,px)*tmp_xyz_line(ic-2) + &
|
||||||
|
WC(2,px)*tmp_xyz_line(ic-1) + &
|
||||||
|
WC(3,px)*tmp_xyz_line(ic ) + &
|
||||||
|
WC(4,px)*tmp_xyz_line(ic+1) + &
|
||||||
|
WC(5,px)*tmp_xyz_line(ic+2) + &
|
||||||
|
WC(6,px)*tmp_xyz_line(ic+3)
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
#endif
|
||||||
return
|
return
|
||||||
|
|
||||||
end subroutine prolong3
|
end subroutine prolong3
|
||||||
@@ -2357,7 +2369,14 @@
|
|||||||
integer::imino,imaxo,jmino,jmaxo,kmino,kmaxo
|
integer::imino,imaxo,jmino,jmaxo,kmino,kmaxo
|
||||||
|
|
||||||
real*8,dimension(3) :: CD,FD
|
real*8,dimension(3) :: CD,FD
|
||||||
|
|
||||||
|
real*8 :: tmp_xz_plane(-1:extf(1), 6)
|
||||||
|
real*8 :: tmp_x_line(-1:extf(1))
|
||||||
|
integer :: fi, fj, fk, ii, jj, kk
|
||||||
|
integer :: fi_min, fi_max, ii_lo, ii_hi
|
||||||
|
integer :: fj_min, fj_max, fk_min, fk_max, jj_lo, jj_hi, kk_lo, kk_hi
|
||||||
|
logical :: need_full_symmetry
|
||||||
|
|
||||||
if(wei.ne.3)then
|
if(wei.ne.3)then
|
||||||
write(*,*)"prolongrestrict.f90::restrict3: this routine only surport 3 dimension"
|
write(*,*)"prolongrestrict.f90::restrict3: this routine only surport 3 dimension"
|
||||||
write(*,*)"dim = ",wei
|
write(*,*)"dim = ",wei
|
||||||
@@ -2436,9 +2455,86 @@
|
|||||||
stop
|
stop
|
||||||
endif
|
endif
|
||||||
|
|
||||||
call symmetry_bd(2,extf,funf,funff,SoA)
|
! 仅计算 X 向最终写回所需的窗口:
|
||||||
|
! func(i,j,k) 只访问 tmp_x_line(fi-2:fi+3)
|
||||||
|
fi_min = 2*(imino + lbc(1) - 1) - 1 - lbf(1) + 1
|
||||||
|
fi_max = 2*(imaxo + lbc(1) - 1) - 1 - lbf(1) + 1
|
||||||
|
fj_min = 2*(jmino + lbc(2) - 1) - 1 - lbf(2) + 1
|
||||||
|
fj_max = 2*(jmaxo + lbc(2) - 1) - 1 - lbf(2) + 1
|
||||||
|
fk_min = 2*(kmino + lbc(3) - 1) - 1 - lbf(3) + 1
|
||||||
|
fk_max = 2*(kmaxo + lbc(3) - 1) - 1 - lbf(3) + 1
|
||||||
|
ii_lo = fi_min - 2
|
||||||
|
ii_hi = fi_max + 3
|
||||||
|
jj_lo = fj_min - 2
|
||||||
|
jj_hi = fj_max + 3
|
||||||
|
kk_lo = fk_min - 2
|
||||||
|
kk_hi = fk_max + 3
|
||||||
|
if(ii_lo < -1 .or. ii_hi > extf(1) .or. &
|
||||||
|
jj_lo < -1 .or. jj_hi > extf(2) .or. &
|
||||||
|
kk_lo < -1 .or. kk_hi > extf(3))then
|
||||||
|
write(*,*)"restrict3: invalid stencil window"
|
||||||
|
write(*,*)"ii=",ii_lo,ii_hi," jj=",jj_lo,jj_hi," kk=",kk_lo,kk_hi
|
||||||
|
write(*,*)"extf=",extf
|
||||||
|
stop
|
||||||
|
endif
|
||||||
|
need_full_symmetry = (ii_lo < 1) .or. (jj_lo < 1) .or. (kk_lo < 1)
|
||||||
|
if(need_full_symmetry)then
|
||||||
|
call symmetry_bd(2,extf,funf,funff,SoA)
|
||||||
|
else
|
||||||
|
funff(ii_lo:ii_hi,jj_lo:jj_hi,kk_lo:kk_hi) = funf(ii_lo:ii_hi,jj_lo:jj_hi,kk_lo:kk_hi)
|
||||||
|
endif
|
||||||
|
|
||||||
!~~~~~~> restriction start...
|
!~~~~~~> restriction start...
|
||||||
|
do k = kmino, kmaxo
|
||||||
|
fk = 2*(k + lbc(3) - 1) - 1 - lbf(3) + 1
|
||||||
|
|
||||||
|
do j = jmino, jmaxo
|
||||||
|
fj = 2*(j + lbc(2) - 1) - 1 - lbf(2) + 1
|
||||||
|
|
||||||
|
! 优化点 1: 显式展开 Z 方向计算,减少循环开销
|
||||||
|
! 确保 ii 循环是最内层且连续访问
|
||||||
|
!DIR$ VECTOR ALWAYS
|
||||||
|
do ii = ii_lo, ii_hi
|
||||||
|
! 预计算当前 j 对应的 6 行在 Z 方向的压缩结果
|
||||||
|
! 这里直接硬编码 jj 的偏移,彻底消除一层循环
|
||||||
|
tmp_xz_plane(ii, 1) = C1*(funff(ii,fj-2,fk-2)+funff(ii,fj-2,fk+3)) + &
|
||||||
|
C2*(funff(ii,fj-2,fk-1)+funff(ii,fj-2,fk+2)) + &
|
||||||
|
C3*(funff(ii,fj-2,fk )+funff(ii,fj-2,fk+1))
|
||||||
|
tmp_xz_plane(ii, 2) = C1*(funff(ii,fj-1,fk-2)+funff(ii,fj-1,fk+3)) + &
|
||||||
|
C2*(funff(ii,fj-1,fk-1)+funff(ii,fj-1,fk+2)) + &
|
||||||
|
C3*(funff(ii,fj-1,fk )+funff(ii,fj-1,fk+1))
|
||||||
|
tmp_xz_plane(ii, 3) = C1*(funff(ii,fj ,fk-2)+funff(ii,fj ,fk+3)) + &
|
||||||
|
C2*(funff(ii,fj ,fk-1)+funff(ii,fj ,fk+2)) + &
|
||||||
|
C3*(funff(ii,fj ,fk )+funff(ii,fj ,fk+1))
|
||||||
|
tmp_xz_plane(ii, 4) = C1*(funff(ii,fj+1,fk-2)+funff(ii,fj+1,fk+3)) + &
|
||||||
|
C2*(funff(ii,fj+1,fk-1)+funff(ii,fj+1,fk+2)) + &
|
||||||
|
C3*(funff(ii,fj+1,fk )+funff(ii,fj+1,fk+1))
|
||||||
|
tmp_xz_plane(ii, 5) = C1*(funff(ii,fj+2,fk-2)+funff(ii,fj+2,fk+3)) + &
|
||||||
|
C2*(funff(ii,fj+2,fk-1)+funff(ii,fj+2,fk+2)) + &
|
||||||
|
C3*(funff(ii,fj+2,fk )+funff(ii,fj+2,fk+1))
|
||||||
|
tmp_xz_plane(ii, 6) = C1*(funff(ii,fj+3,fk-2)+funff(ii,fj+3,fk+3)) + &
|
||||||
|
C2*(funff(ii,fj+3,fk-1)+funff(ii,fj+3,fk+2)) + &
|
||||||
|
C3*(funff(ii,fj+3,fk )+funff(ii,fj+3,fk+1))
|
||||||
|
end do
|
||||||
|
|
||||||
|
! 优化点 2: 同样向量化 Y 方向压缩
|
||||||
|
!DIR$ VECTOR ALWAYS
|
||||||
|
do ii = ii_lo, ii_hi
|
||||||
|
tmp_x_line(ii) = C1*(tmp_xz_plane(ii, 1) + tmp_xz_plane(ii, 6)) + &
|
||||||
|
C2*(tmp_xz_plane(ii, 2) + tmp_xz_plane(ii, 5)) + &
|
||||||
|
C3*(tmp_xz_plane(ii, 3) + tmp_xz_plane(ii, 4))
|
||||||
|
end do
|
||||||
|
|
||||||
|
! 优化点 3: 最终写入,利用已经缓存在 tmp_x_line 的数据
|
||||||
|
do i = imino, imaxo
|
||||||
|
fi = 2*(i + lbc(1) - 1) - 1 - lbf(1) + 1
|
||||||
|
func(i, j, k) = C1*(tmp_x_line(fi-2) + tmp_x_line(fi+3)) + &
|
||||||
|
C2*(tmp_x_line(fi-1) + tmp_x_line(fi+2)) + &
|
||||||
|
C3*(tmp_x_line(fi ) + tmp_x_line(fi+1))
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
end do
|
||||||
|
#if 0
|
||||||
do k = kmino,kmaxo
|
do k = kmino,kmaxo
|
||||||
do j = jmino,jmaxo
|
do j = jmino,jmaxo
|
||||||
do i = imino,imaxo
|
do i = imino,imaxo
|
||||||
@@ -2462,7 +2558,7 @@
|
|||||||
enddo
|
enddo
|
||||||
enddo
|
enddo
|
||||||
enddo
|
enddo
|
||||||
|
#endif
|
||||||
return
|
return
|
||||||
|
|
||||||
end subroutine restrict3
|
end subroutine restrict3
|
||||||
|
|||||||
212
AMSS_NCKU_source/rungekutta4_rout_c.C
Normal file
212
AMSS_NCKU_source/rungekutta4_rout_c.C
Normal file
@@ -0,0 +1,212 @@
|
|||||||
|
#include "rungekutta4_rout.h"
|
||||||
|
#include <cstdio>
|
||||||
|
#include <cstdlib>
|
||||||
|
#include <cstddef>
|
||||||
|
#include <complex>
|
||||||
|
#include <immintrin.h>
|
||||||
|
|
||||||
|
namespace {
|
||||||
|
|
||||||
|
inline void rk4_stage0(std::size_t n,
|
||||||
|
const double *__restrict f0,
|
||||||
|
const double *__restrict frhs,
|
||||||
|
double *__restrict f1,
|
||||||
|
double c) {
|
||||||
|
std::size_t i = 0;
|
||||||
|
#if defined(__AVX512F__)
|
||||||
|
const __m512d vc = _mm512_set1_pd(c);
|
||||||
|
for (; i + 7 < n; i += 8) {
|
||||||
|
const __m512d v0 = _mm512_loadu_pd(f0 + i);
|
||||||
|
const __m512d vr = _mm512_loadu_pd(frhs + i);
|
||||||
|
_mm512_storeu_pd(f1 + i, _mm512_fmadd_pd(vc, vr, v0));
|
||||||
|
}
|
||||||
|
#elif defined(__AVX2__)
|
||||||
|
const __m256d vc = _mm256_set1_pd(c);
|
||||||
|
for (; i + 3 < n; i += 4) {
|
||||||
|
const __m256d v0 = _mm256_loadu_pd(f0 + i);
|
||||||
|
const __m256d vr = _mm256_loadu_pd(frhs + i);
|
||||||
|
_mm256_storeu_pd(f1 + i, _mm256_fmadd_pd(vc, vr, v0));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#pragma ivdep
|
||||||
|
for (; i < n; ++i) {
|
||||||
|
f1[i] = f0[i] + c * frhs[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void rk4_rhs_accum(std::size_t n,
|
||||||
|
const double *__restrict f1,
|
||||||
|
double *__restrict frhs) {
|
||||||
|
std::size_t i = 0;
|
||||||
|
#if defined(__AVX512F__)
|
||||||
|
const __m512d v2 = _mm512_set1_pd(2.0);
|
||||||
|
for (; i + 7 < n; i += 8) {
|
||||||
|
const __m512d v1 = _mm512_loadu_pd(f1 + i);
|
||||||
|
const __m512d vrhs = _mm512_loadu_pd(frhs + i);
|
||||||
|
_mm512_storeu_pd(frhs + i, _mm512_fmadd_pd(v2, v1, vrhs));
|
||||||
|
}
|
||||||
|
#elif defined(__AVX2__)
|
||||||
|
const __m256d v2 = _mm256_set1_pd(2.0);
|
||||||
|
for (; i + 3 < n; i += 4) {
|
||||||
|
const __m256d v1 = _mm256_loadu_pd(f1 + i);
|
||||||
|
const __m256d vrhs = _mm256_loadu_pd(frhs + i);
|
||||||
|
_mm256_storeu_pd(frhs + i, _mm256_fmadd_pd(v2, v1, vrhs));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#pragma ivdep
|
||||||
|
for (; i < n; ++i) {
|
||||||
|
frhs[i] = frhs[i] + 2.0 * f1[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void rk4_f1_from_f0_f1(std::size_t n,
|
||||||
|
const double *__restrict f0,
|
||||||
|
double *__restrict f1,
|
||||||
|
double c) {
|
||||||
|
std::size_t i = 0;
|
||||||
|
#if defined(__AVX512F__)
|
||||||
|
const __m512d vc = _mm512_set1_pd(c);
|
||||||
|
for (; i + 7 < n; i += 8) {
|
||||||
|
const __m512d v0 = _mm512_loadu_pd(f0 + i);
|
||||||
|
const __m512d v1 = _mm512_loadu_pd(f1 + i);
|
||||||
|
_mm512_storeu_pd(f1 + i, _mm512_fmadd_pd(vc, v1, v0));
|
||||||
|
}
|
||||||
|
#elif defined(__AVX2__)
|
||||||
|
const __m256d vc = _mm256_set1_pd(c);
|
||||||
|
for (; i + 3 < n; i += 4) {
|
||||||
|
const __m256d v0 = _mm256_loadu_pd(f0 + i);
|
||||||
|
const __m256d v1 = _mm256_loadu_pd(f1 + i);
|
||||||
|
_mm256_storeu_pd(f1 + i, _mm256_fmadd_pd(vc, v1, v0));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#pragma ivdep
|
||||||
|
for (; i < n; ++i) {
|
||||||
|
f1[i] = f0[i] + c * f1[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
inline void rk4_stage3(std::size_t n,
|
||||||
|
const double *__restrict f0,
|
||||||
|
double *__restrict f1,
|
||||||
|
const double *__restrict frhs,
|
||||||
|
double c) {
|
||||||
|
std::size_t i = 0;
|
||||||
|
#if defined(__AVX512F__)
|
||||||
|
const __m512d vc = _mm512_set1_pd(c);
|
||||||
|
for (; i + 7 < n; i += 8) {
|
||||||
|
const __m512d v0 = _mm512_loadu_pd(f0 + i);
|
||||||
|
const __m512d v1 = _mm512_loadu_pd(f1 + i);
|
||||||
|
const __m512d vr = _mm512_loadu_pd(frhs + i);
|
||||||
|
_mm512_storeu_pd(f1 + i, _mm512_fmadd_pd(vc, _mm512_add_pd(v1, vr), v0));
|
||||||
|
}
|
||||||
|
#elif defined(__AVX2__)
|
||||||
|
const __m256d vc = _mm256_set1_pd(c);
|
||||||
|
for (; i + 3 < n; i += 4) {
|
||||||
|
const __m256d v0 = _mm256_loadu_pd(f0 + i);
|
||||||
|
const __m256d v1 = _mm256_loadu_pd(f1 + i);
|
||||||
|
const __m256d vr = _mm256_loadu_pd(frhs + i);
|
||||||
|
_mm256_storeu_pd(f1 + i, _mm256_fmadd_pd(vc, _mm256_add_pd(v1, vr), v0));
|
||||||
|
}
|
||||||
|
#endif
|
||||||
|
#pragma ivdep
|
||||||
|
for (; i < n; ++i) {
|
||||||
|
f1[i] = f0[i] + c * (f1[i] + frhs[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace
|
||||||
|
|
||||||
|
extern "C" {
|
||||||
|
|
||||||
|
void f_rungekutta4_scalar(double &dT, double &f0, double &f1, double &f_rhs, int &RK4) {
|
||||||
|
constexpr double F1o6 = 1.0 / 6.0;
|
||||||
|
constexpr double HLF = 0.5;
|
||||||
|
constexpr double TWO = 2.0;
|
||||||
|
|
||||||
|
switch (RK4) {
|
||||||
|
case 0:
|
||||||
|
f1 = f0 + HLF * dT * f_rhs;
|
||||||
|
break;
|
||||||
|
case 1:
|
||||||
|
f_rhs = f_rhs + TWO * f1;
|
||||||
|
f1 = f0 + HLF * dT * f1;
|
||||||
|
break;
|
||||||
|
case 2:
|
||||||
|
f_rhs = f_rhs + TWO * f1;
|
||||||
|
f1 = f0 + dT * f1;
|
||||||
|
break;
|
||||||
|
case 3:
|
||||||
|
f1 = f0 + F1o6 * dT * (f1 + f_rhs);
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
std::fprintf(stderr, "rungekutta4_scalar_c: invalid RK4 stage %d\n", RK4);
|
||||||
|
std::abort();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void rungekutta4_cplxscalar_(double &dT,
|
||||||
|
std::complex<double> &f0,
|
||||||
|
std::complex<double> &f1,
|
||||||
|
std::complex<double> &f_rhs,
|
||||||
|
int &RK4) {
|
||||||
|
constexpr double F1o6 = 1.0 / 6.0;
|
||||||
|
constexpr double HLF = 0.5;
|
||||||
|
constexpr double TWO = 2.0;
|
||||||
|
|
||||||
|
switch (RK4) {
|
||||||
|
case 0:
|
||||||
|
f1 = f0 + HLF * dT * f_rhs;
|
||||||
|
break;
|
||||||
|
case 1:
|
||||||
|
f_rhs = f_rhs + TWO * f1;
|
||||||
|
f1 = f0 + HLF * dT * f1;
|
||||||
|
break;
|
||||||
|
case 2:
|
||||||
|
f_rhs = f_rhs + TWO * f1;
|
||||||
|
f1 = f0 + dT * f1;
|
||||||
|
break;
|
||||||
|
case 3:
|
||||||
|
f1 = f0 + F1o6 * dT * (f1 + f_rhs);
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
std::fprintf(stderr, "rungekutta4_cplxscalar_c: invalid RK4 stage %d\n", RK4);
|
||||||
|
std::abort();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int f_rungekutta4_rout(int *ex, double &dT,
|
||||||
|
double *f0, double *f1, double *f_rhs,
|
||||||
|
int &RK4) {
|
||||||
|
const std::size_t n = static_cast<std::size_t>(ex[0]) *
|
||||||
|
static_cast<std::size_t>(ex[1]) *
|
||||||
|
static_cast<std::size_t>(ex[2]);
|
||||||
|
const double *const __restrict f0r = f0;
|
||||||
|
double *const __restrict f1r = f1;
|
||||||
|
double *const __restrict frhs = f_rhs;
|
||||||
|
|
||||||
|
if (__builtin_expect(static_cast<unsigned>(RK4) > 3u, 0)) {
|
||||||
|
std::fprintf(stderr, "rungekutta4_rout_c: invalid RK4 stage %d\n", RK4);
|
||||||
|
std::abort();
|
||||||
|
}
|
||||||
|
|
||||||
|
switch (RK4) {
|
||||||
|
case 0:
|
||||||
|
rk4_stage0(n, f0r, frhs, f1r, 0.5 * dT);
|
||||||
|
break;
|
||||||
|
case 1:
|
||||||
|
rk4_rhs_accum(n, f1r, frhs);
|
||||||
|
rk4_f1_from_f0_f1(n, f0r, f1r, 0.5 * dT);
|
||||||
|
break;
|
||||||
|
case 2:
|
||||||
|
rk4_rhs_accum(n, f1r, frhs);
|
||||||
|
rk4_f1_from_f0_f1(n, f0r, f1r, dT);
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
rk4_stage3(n, f0r, f1r, frhs, (1.0 / 6.0) * dT);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
} // extern "C"
|
||||||
@@ -5,6 +5,7 @@
|
|||||||
#include <stddef.h>
|
#include <stddef.h>
|
||||||
#include <math.h>
|
#include <math.h>
|
||||||
#include <stdio.h>
|
#include <stdio.h>
|
||||||
|
#include <string.h>
|
||||||
/* 主网格:0-based -> 1D */
|
/* 主网格:0-based -> 1D */
|
||||||
static inline size_t idx_ex(int i0, int j0, int k0, const int ex[3]) {
|
static inline size_t idx_ex(int i0, int j0, int k0, const int ex[3]) {
|
||||||
const int ex1 = ex[0], ex2 = ex[1];
|
const int ex1 = ex[0], ex2 = ex[1];
|
||||||
@@ -87,60 +88,159 @@ static inline size_t idx_funcc_F(int iF, int jF, int kF, int ord, const int extc
|
|||||||
* funcc(:,:,-i) = funcc(:,:,i+1)*SoA(3)
|
* funcc(:,:,-i) = funcc(:,:,i+1)*SoA(3)
|
||||||
* enddo
|
* enddo
|
||||||
*/
|
*/
|
||||||
|
static inline void symmetry_bd_impl(int ord,
|
||||||
|
int shift,
|
||||||
|
const int extc[3],
|
||||||
|
const double *__restrict func,
|
||||||
|
double *__restrict funcc,
|
||||||
|
const double SoA[3])
|
||||||
|
{
|
||||||
|
const int extc1 = extc[0], extc2 = extc[1], extc3 = extc[2];
|
||||||
|
const int nx = extc1 + ord;
|
||||||
|
const int ny = extc2 + ord;
|
||||||
|
|
||||||
|
const size_t snx = (size_t)nx;
|
||||||
|
const size_t splane = (size_t)nx * (size_t)ny;
|
||||||
|
const size_t interior_i = (size_t)shift + 1u; /* iF = 1 */
|
||||||
|
const size_t interior_j = ((size_t)shift + 1u) * snx; /* jF = 1 */
|
||||||
|
const size_t interior_k = ((size_t)shift + 1u) * splane; /* kF = 1 */
|
||||||
|
const size_t interior0 = interior_k + interior_j + interior_i;
|
||||||
|
|
||||||
|
/* 1) funcc(1:extc1,1:extc2,1:extc3) = func */
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const double *src_k = func + (size_t)k0 * (size_t)extc2 * (size_t)extc1;
|
||||||
|
const size_t dst_k0 = interior0 + (size_t)k0 * splane;
|
||||||
|
for (int j0 = 0; j0 < extc2; ++j0) {
|
||||||
|
const double *src = src_k + (size_t)j0 * (size_t)extc1;
|
||||||
|
double *dst = funcc + dst_k0 + (size_t)j0 * snx;
|
||||||
|
memcpy(dst, src, (size_t)extc1 * sizeof(double));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 2) funcc(-i,1:extc2,1:extc3) = funcc(i+1,1:extc2,1:extc3)*SoA(1) */
|
||||||
|
const double s1 = SoA[0];
|
||||||
|
if (s1 == 1.0) {
|
||||||
|
for (int ii = 0; ii < ord; ++ii) {
|
||||||
|
const size_t dst_i = (size_t)(shift - ii);
|
||||||
|
const size_t src_i = (size_t)(shift + ii + 1);
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const size_t kbase = interior_k + (size_t)k0 * splane + interior_j;
|
||||||
|
for (int j0 = 0; j0 < extc2; ++j0) {
|
||||||
|
const size_t off = kbase + (size_t)j0 * snx;
|
||||||
|
funcc[off + dst_i] = funcc[off + src_i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else if (s1 == -1.0) {
|
||||||
|
for (int ii = 0; ii < ord; ++ii) {
|
||||||
|
const size_t dst_i = (size_t)(shift - ii);
|
||||||
|
const size_t src_i = (size_t)(shift + ii + 1);
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const size_t kbase = interior_k + (size_t)k0 * splane + interior_j;
|
||||||
|
for (int j0 = 0; j0 < extc2; ++j0) {
|
||||||
|
const size_t off = kbase + (size_t)j0 * snx;
|
||||||
|
funcc[off + dst_i] = -funcc[off + src_i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
for (int ii = 0; ii < ord; ++ii) {
|
||||||
|
const size_t dst_i = (size_t)(shift - ii);
|
||||||
|
const size_t src_i = (size_t)(shift + ii + 1);
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const size_t kbase = interior_k + (size_t)k0 * splane + interior_j;
|
||||||
|
for (int j0 = 0; j0 < extc2; ++j0) {
|
||||||
|
const size_t off = kbase + (size_t)j0 * snx;
|
||||||
|
funcc[off + dst_i] = funcc[off + src_i] * s1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 3) funcc(:,-j,1:extc3) = funcc(:,j+1,1:extc3)*SoA(2) */
|
||||||
|
const double s2 = SoA[1];
|
||||||
|
if (s2 == 1.0) {
|
||||||
|
for (int jj = 0; jj < ord; ++jj) {
|
||||||
|
const size_t dst_j = (size_t)(shift - jj) * snx;
|
||||||
|
const size_t src_j = (size_t)(shift + jj + 1) * snx;
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const size_t kbase = interior_k + (size_t)k0 * splane;
|
||||||
|
double *dst = funcc + kbase + dst_j;
|
||||||
|
const double *src = funcc + kbase + src_j;
|
||||||
|
for (int i = 0; i < nx; ++i) dst[i] = src[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else if (s2 == -1.0) {
|
||||||
|
for (int jj = 0; jj < ord; ++jj) {
|
||||||
|
const size_t dst_j = (size_t)(shift - jj) * snx;
|
||||||
|
const size_t src_j = (size_t)(shift + jj + 1) * snx;
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const size_t kbase = interior_k + (size_t)k0 * splane;
|
||||||
|
double *dst = funcc + kbase + dst_j;
|
||||||
|
const double *src = funcc + kbase + src_j;
|
||||||
|
for (int i = 0; i < nx; ++i) dst[i] = -src[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
for (int jj = 0; jj < ord; ++jj) {
|
||||||
|
const size_t dst_j = (size_t)(shift - jj) * snx;
|
||||||
|
const size_t src_j = (size_t)(shift + jj + 1) * snx;
|
||||||
|
for (int k0 = 0; k0 < extc3; ++k0) {
|
||||||
|
const size_t kbase = interior_k + (size_t)k0 * splane;
|
||||||
|
double *dst = funcc + kbase + dst_j;
|
||||||
|
const double *src = funcc + kbase + src_j;
|
||||||
|
for (int i = 0; i < nx; ++i) dst[i] = src[i] * s2;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* 4) funcc(:,:,-k) = funcc(:,:,k+1)*SoA(3) */
|
||||||
|
const double s3 = SoA[2];
|
||||||
|
if (s3 == 1.0) {
|
||||||
|
for (int kk = 0; kk < ord; ++kk) {
|
||||||
|
const size_t dst_k = (size_t)(shift - kk) * splane;
|
||||||
|
const size_t src_k = (size_t)(shift + kk + 1) * splane;
|
||||||
|
double *dst = funcc + dst_k;
|
||||||
|
const double *src = funcc + src_k;
|
||||||
|
for (size_t p = 0; p < splane; ++p) dst[p] = src[p];
|
||||||
|
}
|
||||||
|
} else if (s3 == -1.0) {
|
||||||
|
for (int kk = 0; kk < ord; ++kk) {
|
||||||
|
const size_t dst_k = (size_t)(shift - kk) * splane;
|
||||||
|
const size_t src_k = (size_t)(shift + kk + 1) * splane;
|
||||||
|
double *dst = funcc + dst_k;
|
||||||
|
const double *src = funcc + src_k;
|
||||||
|
for (size_t p = 0; p < splane; ++p) dst[p] = -src[p];
|
||||||
|
}
|
||||||
|
} else {
|
||||||
|
for (int kk = 0; kk < ord; ++kk) {
|
||||||
|
const size_t dst_k = (size_t)(shift - kk) * splane;
|
||||||
|
const size_t src_k = (size_t)(shift + kk + 1) * splane;
|
||||||
|
double *dst = funcc + dst_k;
|
||||||
|
const double *src = funcc + src_k;
|
||||||
|
for (size_t p = 0; p < splane; ++p) dst[p] = src[p] * s3;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
static inline void symmetry_bd(int ord,
|
static inline void symmetry_bd(int ord,
|
||||||
const int extc[3],
|
const int extc[3],
|
||||||
const double *func,
|
const double *func,
|
||||||
double *funcc,
|
double *funcc,
|
||||||
const double SoA[3])
|
const double SoA[3])
|
||||||
{
|
{
|
||||||
const int extc1 = extc[0], extc2 = extc[1], extc3 = extc[2];
|
if (ord <= 0) return;
|
||||||
|
|
||||||
// 1) funcc(1:extc1,1:extc2,1:extc3) = func
|
/* Fast paths used by current C kernels: ord=2 (derivs), ord=3 (lopsided/KO). */
|
||||||
// Fortran 的 (iF=1..extc1) 对应 C 的 func(i0=0..extc1-1)
|
if (ord == 2) {
|
||||||
for (int k0 = 0; k0 < extc3; ++k0) {
|
symmetry_bd_impl(2, 1, extc, func, funcc, SoA);
|
||||||
for (int j0 = 0; j0 < extc2; ++j0) {
|
return;
|
||||||
for (int i0 = 0; i0 < extc1; ++i0) {
|
}
|
||||||
const int iF = i0 + 1, jF = j0 + 1, kF = k0 + 1;
|
if (ord == 3) {
|
||||||
funcc[idx_funcc_F(iF, jF, kF, ord, extc)] = func[idx_func0(i0, j0, k0, extc)];
|
symmetry_bd_impl(3, 2, extc, func, funcc, SoA);
|
||||||
}
|
return;
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// 2) do i=0..ord-1: funcc(-i, 1:extc2, 1:extc3) = funcc(i+1, ...)*SoA(1)
|
symmetry_bd_impl(ord, ord - 1, extc, func, funcc, SoA);
|
||||||
for (int ii = 0; ii <= ord - 1; ++ii) {
|
|
||||||
const int iF_dst = -ii; // 0, -1, -2, ...
|
|
||||||
const int iF_src = ii + 1; // 1, 2, 3, ...
|
|
||||||
for (int kF = 1; kF <= extc3; ++kF) {
|
|
||||||
for (int jF = 1; jF <= extc2; ++jF) {
|
|
||||||
funcc[idx_funcc_F(iF_dst, jF, kF, ord, extc)] =
|
|
||||||
funcc[idx_funcc_F(iF_src, jF, kF, ord, extc)] * SoA[0];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// 3) do i=0..ord-1: funcc(:,-i, 1:extc3) = funcc(:, i+1, 1:extc3)*SoA(2)
|
|
||||||
// 注意 Fortran 这里的 ":" 表示 iF 从 (-ord+1..extc1) 全覆盖
|
|
||||||
for (int jj = 0; jj <= ord - 1; ++jj) {
|
|
||||||
const int jF_dst = -jj;
|
|
||||||
const int jF_src = jj + 1;
|
|
||||||
for (int kF = 1; kF <= extc3; ++kF) {
|
|
||||||
for (int iF = -ord + 1; iF <= extc1; ++iF) {
|
|
||||||
funcc[idx_funcc_F(iF, jF_dst, kF, ord, extc)] =
|
|
||||||
funcc[idx_funcc_F(iF, jF_src, kF, ord, extc)] * SoA[1];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// 4) do i=0..ord-1: funcc(:,:,-i) = funcc(:,:, i+1)*SoA(3)
|
|
||||||
for (int kk = 0; kk <= ord - 1; ++kk) {
|
|
||||||
const int kF_dst = -kk;
|
|
||||||
const int kF_src = kk + 1;
|
|
||||||
for (int jF = -ord + 1; jF <= extc2; ++jF) {
|
|
||||||
for (int iF = -ord + 1; iF <= extc1; ++iF) {
|
|
||||||
funcc[idx_funcc_F(iF, jF, kF_dst, ord, extc)] =
|
|
||||||
funcc[idx_funcc_F(iF, jF, kF_src, ord, extc)] * SoA[2];
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
@@ -27,19 +27,24 @@ using namespace std;
|
|||||||
class surface_integral
|
class surface_integral
|
||||||
{
|
{
|
||||||
|
|
||||||
private:
|
private:
|
||||||
int Symmetry, factor;
|
int Symmetry, factor;
|
||||||
int N_theta, N_phi; // Number of points in Theta & Phi directions
|
int N_theta, N_phi; // Number of points in Theta & Phi directions
|
||||||
double dphi, dcostheta;
|
double dphi, dcostheta;
|
||||||
double *arcostheta, *wtcostheta;
|
double *arcostheta, *wtcostheta;
|
||||||
int n_tot; // size of arrays
|
int n_tot; // size of arrays
|
||||||
|
|
||||||
double *nx_g, *ny_g, *nz_g; // global list of unit normals
|
double *nx_g, *ny_g, *nz_g; // global list of unit normals
|
||||||
int myrank, cpusize;
|
int myrank, cpusize;
|
||||||
|
int wave_cache_spinw, wave_cache_maxl, wave_cache_modes;
|
||||||
public:
|
double *wave_theta_pos, *wave_theta_neg;
|
||||||
surface_integral(int iSymmetry);
|
double *wave_phi_cos, *wave_phi_sin;
|
||||||
~surface_integral();
|
void clear_wave_cache();
|
||||||
|
void build_wave_cache(int spinw, int maxl);
|
||||||
|
|
||||||
|
public:
|
||||||
|
surface_integral(int iSymmetry);
|
||||||
|
~surface_integral();
|
||||||
|
|
||||||
void surf_Wave(double rex, int lev, cgh *GH, var *Rpsi4, var *Ipsi4,
|
void surf_Wave(double rex, int lev, cgh *GH, var *Rpsi4, var *Ipsi4,
|
||||||
int spinw, int maxl, int NN, double *RP, double *IP,
|
int spinw, int maxl, int NN, double *RP, double *IP,
|
||||||
@@ -77,21 +82,37 @@ public:
|
|||||||
double &, double &, double &, double &, double &, double &, double &,
|
double &, double &, double &, double &, double &, double &, double &,
|
||||||
double &, double &, double &, double &, double &, double &,
|
double &, double &, double &, double &, double &, double &,
|
||||||
double &, double &)); // NN is the length of RP and IP
|
double &, double &)); // NN is the length of RP and IP
|
||||||
void surf_MassPAng(double rex, int lev, cgh *GH, var *chi, var *trK,
|
void surf_MassPAng(double rex, int lev, cgh *GH, var *chi, var *trK,
|
||||||
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
||||||
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
||||||
var *Gmx, var *Gmy, var *Gmz,
|
var *Gmx, var *Gmy, var *Gmz,
|
||||||
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs,
|
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs,
|
||||||
double *Rout, monitor *Monitor);
|
double *Rout, monitor *Monitor, bool refresh_mass_fields = true);
|
||||||
void surf_MassPAng(double rex, int lev, ShellPatch *GH, var *chi, var *trK,
|
void surf_MassPAng(double rex, int lev, ShellPatch *GH, var *chi, var *trK,
|
||||||
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
||||||
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
||||||
var *Gmx, var *Gmy, var *Gmz,
|
var *Gmx, var *Gmy, var *Gmz,
|
||||||
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs,
|
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs,
|
||||||
double *Rout, monitor *Monitor);
|
double *Rout, monitor *Monitor, bool refresh_mass_fields = true);
|
||||||
void surf_Wave(double rex, cgh *GH, ShellPatch *SH,
|
void surf_WaveMassPAng(double rex, int lev, cgh *GH,
|
||||||
var *chi, var *trK,
|
var *Rpsi4, var *Ipsi4, int spinw, int maxl, int NN, double *RP, double *IP,
|
||||||
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
var *chi, var *trK,
|
||||||
|
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
||||||
|
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
||||||
|
var *Gmx, var *Gmy, var *Gmz,
|
||||||
|
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs,
|
||||||
|
double *Rout, monitor *Monitor, bool refresh_mass_fields = true);
|
||||||
|
void surf_WaveMassPAng(double rex, int lev, ShellPatch *GH,
|
||||||
|
var *Rpsi4, var *Ipsi4, int spinw, int maxl, int NN, double *RP, double *IP,
|
||||||
|
var *chi, var *trK,
|
||||||
|
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
||||||
|
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
||||||
|
var *Gmx, var *Gmy, var *Gmz,
|
||||||
|
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs,
|
||||||
|
double *Rout, monitor *Monitor, bool refresh_mass_fields = true);
|
||||||
|
void surf_Wave(double rex, cgh *GH, ShellPatch *SH,
|
||||||
|
var *chi, var *trK,
|
||||||
|
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
||||||
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
||||||
var *chix, var *chiy, var *chiz,
|
var *chix, var *chiy, var *chiz,
|
||||||
var *trKx, var *trKy, var *trKz,
|
var *trKx, var *trKy, var *trKz,
|
||||||
@@ -110,12 +131,12 @@ public:
|
|||||||
bool SR_Interp_Points(MyList<var> *VarList, cgh *GH, ShellPatch *SH,
|
bool SR_Interp_Points(MyList<var> *VarList, cgh *GH, ShellPatch *SH,
|
||||||
int NN, double **XX, double *Shellf);
|
int NN, double **XX, double *Shellf);
|
||||||
|
|
||||||
void surf_MassPAng(double rex, int lev, cgh *GH, var *chi, var *trK,
|
void surf_MassPAng(double rex, int lev, cgh *GH, var *chi, var *trK,
|
||||||
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
var *gxx, var *gxy, var *gxz, var *gyy, var *gyz, var *gzz,
|
||||||
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
var *Axx, var *Axy, var *Axz, var *Ayy, var *Ayz, var *Azz,
|
||||||
var *Gmx, var *Gmy, var *Gmz,
|
var *Gmx, var *Gmy, var *Gmz,
|
||||||
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs, // temparay memory for mass^i
|
var *Sfx_rhs, var *Sfy_rhs, var *Sfz_rhs, // temparay memory for mass^i
|
||||||
double *Rout, monitor *Monitor, MPI_Comm Comm_here);
|
double *Rout, monitor *Monitor, MPI_Comm Comm_here, bool refresh_mass_fields = true);
|
||||||
void surf_Wave(double rex, int lev, cgh *GH, var *Rpsi4, var *Ipsi4,
|
void surf_Wave(double rex, int lev, cgh *GH, var *Rpsi4, var *Ipsi4,
|
||||||
int spinw, int maxl, int NN, double *RP, double *IP,
|
int spinw, int maxl, int NN, double *RP, double *IP,
|
||||||
monitor *Monitor, MPI_Comm Comm_here);
|
monitor *Monitor, MPI_Comm Comm_here);
|
||||||
|
|||||||
@@ -24,4 +24,10 @@ void lopsided(const int ex[3],
|
|||||||
const double *X, const double *Y, const double *Z,
|
const double *X, const double *Y, const double *Z,
|
||||||
const double *f, double *f_rhs,
|
const double *f, double *f_rhs,
|
||||||
const double *Sfx, const double *Sfy, const double *Sfz,
|
const double *Sfx, const double *Sfy, const double *Sfz,
|
||||||
int Symmetry, const double SoA[3]);
|
int Symmetry, const double SoA[3]);
|
||||||
|
|
||||||
|
void lopsided_kodis(const int ex[3],
|
||||||
|
const double *X, const double *Y, const double *Z,
|
||||||
|
const double *f, double *f_rhs,
|
||||||
|
const double *Sfx, const double *Sfy, const double *Sfz,
|
||||||
|
int Symmetry, const double SoA[3], double eps);
|
||||||
|
|||||||
211
BSSN_BUILD_CONFIG_MIGRATION.md
Normal file
211
BSSN_BUILD_CONFIG_MIGRATION.md
Normal file
@@ -0,0 +1,211 @@
|
|||||||
|
# BSSN Build Config Migration
|
||||||
|
|
||||||
|
This note records the build-configuration fix needed when replacing
|
||||||
|
`AMSS_NCKU_Input.py` or `generate_macrodef.py` with a newer upstream version.
|
||||||
|
|
||||||
|
## Problem
|
||||||
|
|
||||||
|
`AMSS_NCKU_source/macrodef.h` is not the authoritative file used by normal
|
||||||
|
runs. `AMSS_NCKU_Program.py` first generates macro files under
|
||||||
|
`input_data.File_directory`, copies `AMSS_NCKU_source` to
|
||||||
|
`<File_directory>/AMSS_NCKU_source_copy`, then copies the generated macro files
|
||||||
|
into that copied source tree and compiles there.
|
||||||
|
|
||||||
|
Therefore, makefile logic must not depend only on the stale
|
||||||
|
`AMSS_NCKU_source/macrodef.h`. The actual equation path must be passed to the
|
||||||
|
copied build tree from the same generation step that creates `macrodef.h`.
|
||||||
|
|
||||||
|
The performance regression was caused by compiling/linking the
|
||||||
|
`BSSN-EScalar` C wrapper into BSSN vacuum builds. For BSSN vacuum (`ABEtype=0`),
|
||||||
|
the build must use:
|
||||||
|
|
||||||
|
```make
|
||||||
|
BSSN_USE_TRANSFER_CACHE=1
|
||||||
|
BSSN_USE_ESCALAR_C_KERNEL=0
|
||||||
|
```
|
||||||
|
|
||||||
|
and must not link `bssn_escalar_rhs_c.o`.
|
||||||
|
|
||||||
|
## Required Migration Steps
|
||||||
|
|
||||||
|
### 1. Add an ABE type helper in `generate_macrodef.py`
|
||||||
|
|
||||||
|
Add a helper that maps `input_data.Equation_Class` to the numeric `ABEtype`.
|
||||||
|
Use the same mapping as `macrodef.h`:
|
||||||
|
|
||||||
|
```python
|
||||||
|
def get_abe_type():
|
||||||
|
if ( input_data.Equation_Class == "BSSN" ):
|
||||||
|
return 0
|
||||||
|
elif ( input_data.Equation_Class == "BSSN-EScalar" ):
|
||||||
|
return 1
|
||||||
|
elif ( input_data.Equation_Class == "BSSN-EM" ):
|
||||||
|
return 3
|
||||||
|
elif ( input_data.Equation_Class == "Z4C" ):
|
||||||
|
return 2
|
||||||
|
else:
|
||||||
|
raise ValueError("Equation_Class setting error!!!")
|
||||||
|
```
|
||||||
|
|
||||||
|
Update `generate_macrodef_h()` to print `#define ABEtype {get_abe_type()}`
|
||||||
|
instead of duplicating the if/elif mapping.
|
||||||
|
|
||||||
|
### 2. Generate a makefile fragment
|
||||||
|
|
||||||
|
In `generate_macrodef.py`, add:
|
||||||
|
|
||||||
|
```python
|
||||||
|
def generate_build_config():
|
||||||
|
file1 = open(os.path.join(input_data.File_directory, "AMSS_NCKU_build.mk"), "w")
|
||||||
|
print("# Generated by generate_macrodef.py; do not edit manually.", file=file1)
|
||||||
|
print(f"ABE_TYPE := {get_abe_type()}", file=file1)
|
||||||
|
file1.close()
|
||||||
|
```
|
||||||
|
|
||||||
|
This file is the build-time authority for the equation path.
|
||||||
|
|
||||||
|
### 3. Call and copy the generated build config
|
||||||
|
|
||||||
|
In `AMSS_NCKU_Program.py`, after generating `macrodef.h` and `macrodef.fh`, call:
|
||||||
|
|
||||||
|
```python
|
||||||
|
generate_macrodef.generate_build_config()
|
||||||
|
print(" AMSS-NCKU build config AMSS_NCKU_build.mk has been generated. ")
|
||||||
|
```
|
||||||
|
|
||||||
|
When copying generated files into `AMSS_NCKU_source_copy`, also copy:
|
||||||
|
|
||||||
|
```python
|
||||||
|
build_config_path = os.path.join(File_directory, "AMSS_NCKU_build.mk")
|
||||||
|
shutil.copy2(build_config_path, AMSS_NCKU_source_copy)
|
||||||
|
```
|
||||||
|
|
||||||
|
### 4. Make the source makefile consume the generated config
|
||||||
|
|
||||||
|
At the top of `AMSS_NCKU_source/makefile`, after `include makefile.inc`, add:
|
||||||
|
|
||||||
|
```make
|
||||||
|
-include AMSS_NCKU_build.mk
|
||||||
|
|
||||||
|
ABE_TYPE ?= $(shell awk '/^[[:space:]]*\#define[[:space:]]+ABEtype/ {print $$3; exit}' macrodef.h 2>/dev/null)
|
||||||
|
```
|
||||||
|
|
||||||
|
The generated `AMSS_NCKU_build.mk` is used during normal Python-driven builds.
|
||||||
|
The fallback keeps manual source-tree builds usable.
|
||||||
|
|
||||||
|
### 5. Gate path-specific build options by `ABE_TYPE`
|
||||||
|
|
||||||
|
Use effective build switches:
|
||||||
|
|
||||||
|
```make
|
||||||
|
ifeq ($(USE_TRANSFER_CACHE),auto)
|
||||||
|
ifeq ($(ABE_TYPE),0)
|
||||||
|
EFFECTIVE_USE_TRANSFER_CACHE = 1
|
||||||
|
else
|
||||||
|
EFFECTIVE_USE_TRANSFER_CACHE = 0
|
||||||
|
endif
|
||||||
|
else
|
||||||
|
EFFECTIVE_USE_TRANSFER_CACHE = $(USE_TRANSFER_CACHE)
|
||||||
|
endif
|
||||||
|
|
||||||
|
ifeq ($(USE_CXX_ESCALAR_KERNEL),1)
|
||||||
|
ifeq ($(ABE_TYPE),1)
|
||||||
|
EFFECTIVE_USE_CXX_ESCALAR_KERNEL = 1
|
||||||
|
else
|
||||||
|
EFFECTIVE_USE_CXX_ESCALAR_KERNEL = 0
|
||||||
|
endif
|
||||||
|
else
|
||||||
|
EFFECTIVE_USE_CXX_ESCALAR_KERNEL = 0
|
||||||
|
endif
|
||||||
|
|
||||||
|
TRANSFER_CACHE_FLAG = -DBSSN_USE_TRANSFER_CACHE=$(EFFECTIVE_USE_TRANSFER_CACHE)
|
||||||
|
ESCALAR_KERNEL_FLAG = -DBSSN_USE_ESCALAR_C_KERNEL=$(EFFECTIVE_USE_CXX_ESCALAR_KERNEL)
|
||||||
|
```
|
||||||
|
|
||||||
|
Only add `bssn_escalar_rhs_c.o` when the effective EScalar C kernel switch is
|
||||||
|
enabled:
|
||||||
|
|
||||||
|
```make
|
||||||
|
ifeq ($(EFFECTIVE_USE_CXX_ESCALAR_KERNEL),1)
|
||||||
|
CFILES += bssn_escalar_rhs_c.o
|
||||||
|
endif
|
||||||
|
```
|
||||||
|
|
||||||
|
### 6. Use safe transfer-cache default
|
||||||
|
|
||||||
|
In `AMSS_NCKU_source/makefile.inc`, keep:
|
||||||
|
|
||||||
|
```make
|
||||||
|
USE_TRANSFER_CACHE ?= auto
|
||||||
|
```
|
||||||
|
|
||||||
|
With the effective switch logic above, this enables cached transfer for BSSN
|
||||||
|
vacuum while keeping non-BSSN paths on the uncached path by default.
|
||||||
|
|
||||||
|
## Verification Checklist
|
||||||
|
|
||||||
|
Run these checks after migrating:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
python3 -c "import generate_macrodef; generate_macrodef.generate_build_config()"
|
||||||
|
cat GW150914/AMSS_NCKU_build.mk
|
||||||
|
```
|
||||||
|
|
||||||
|
For BSSN, the generated file should contain:
|
||||||
|
|
||||||
|
```make
|
||||||
|
ABE_TYPE := 0
|
||||||
|
```
|
||||||
|
|
||||||
|
Dry-run the copied or source makefile:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
make -n -B INTERP_LB_MODE=off ABE | grep -E 'BSSN_USE_TRANSFER_CACHE|BSSN_USE_ESCALAR_C_KERNEL|bssn_escalar_rhs_c'
|
||||||
|
```
|
||||||
|
|
||||||
|
Expected BSSN result:
|
||||||
|
|
||||||
|
```text
|
||||||
|
-DBSSN_USE_TRANSFER_CACHE=1 -DBSSN_USE_ESCALAR_C_KERNEL=0
|
||||||
|
```
|
||||||
|
|
||||||
|
and no `bssn_escalar_rhs_c.o` in the final link command.
|
||||||
|
|
||||||
|
Run the full workflow:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
python3 AMSS_NCKU_Program.py
|
||||||
|
```
|
||||||
|
|
||||||
|
For the 10-step BSSN test, compare coordinate output:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
python3 - <<'PY'
|
||||||
|
from pathlib import Path
|
||||||
|
old = Path('../GW150914-06457/AMSS_NCKU_output/bssn_BH.dat')
|
||||||
|
new = Path('GW150914/AMSS_NCKU_output/bssn_BH.dat')
|
||||||
|
|
||||||
|
def rows(path):
|
||||||
|
out = []
|
||||||
|
for line in path.read_text().splitlines():
|
||||||
|
if not line.strip() or line.lstrip().startswith('#'):
|
||||||
|
continue
|
||||||
|
out.append([float(x) for x in line.split()])
|
||||||
|
return out
|
||||||
|
|
||||||
|
ro, rn = rows(old), rows(new)
|
||||||
|
n = min(len(ro), len(rn))
|
||||||
|
max_abs = 0.0
|
||||||
|
for i in range(n):
|
||||||
|
for a, b in zip(ro[i], rn[i]):
|
||||||
|
max_abs = max(max_abs, abs(a - b))
|
||||||
|
print(f"old_rows={len(ro)} new_rows={len(rn)} compared_rows={n}")
|
||||||
|
print(f"max_abs_diff={max_abs:.17g}")
|
||||||
|
PY
|
||||||
|
```
|
||||||
|
|
||||||
|
For the validated migration, the first 10 rows matched exactly:
|
||||||
|
|
||||||
|
```text
|
||||||
|
max_abs_diff=0
|
||||||
|
```
|
||||||
@@ -12,6 +12,37 @@ import os
|
|||||||
import AMSS_NCKU_Input as input_data ## import program input file
|
import AMSS_NCKU_Input as input_data ## import program input file
|
||||||
|
|
||||||
|
|
||||||
|
##################################################################
|
||||||
|
|
||||||
|
def get_abe_type():
|
||||||
|
if ( input_data.Equation_Class == "BSSN" ):
|
||||||
|
return 0
|
||||||
|
elif ( input_data.Equation_Class == "BSSN-EScalar" ):
|
||||||
|
return 1
|
||||||
|
elif ( input_data.Equation_Class == "BSSN-EM" ):
|
||||||
|
return 3
|
||||||
|
elif ( input_data.Equation_Class == "Z4C" ):
|
||||||
|
return 2
|
||||||
|
else:
|
||||||
|
raise ValueError("Equation_Class setting error!!!")
|
||||||
|
|
||||||
|
|
||||||
|
##################################################################
|
||||||
|
|
||||||
|
## Generate the makefile fragment used by the copied source tree.
|
||||||
|
## The source-tree macrodef.h is not authoritative because macro files
|
||||||
|
## are regenerated under File_directory for each run.
|
||||||
|
|
||||||
|
def generate_build_config():
|
||||||
|
|
||||||
|
file1 = open( os.path.join(input_data.File_directory, "AMSS_NCKU_build.mk"), "w")
|
||||||
|
|
||||||
|
print( "# Generated by generate_macrodef.py; do not edit manually.", file=file1 )
|
||||||
|
print( f"ABE_TYPE := {get_abe_type()}", file=file1 )
|
||||||
|
|
||||||
|
file1.close()
|
||||||
|
|
||||||
|
|
||||||
##################################################################
|
##################################################################
|
||||||
|
|
||||||
## Generate the macro file macrodef.h according to user settings
|
## Generate the macro file macrodef.h according to user settings
|
||||||
@@ -58,19 +89,10 @@ def generate_macrodef_h():
|
|||||||
# 2: Z4c vacuum
|
# 2: Z4c vacuum
|
||||||
# 3: coupled to Maxwell field
|
# 3: coupled to Maxwell field
|
||||||
|
|
||||||
if ( input_data.Equation_Class == "BSSN" ):
|
try:
|
||||||
print( "#define ABEtype 0", file=file1 )
|
print( f"#define ABEtype {get_abe_type()}", file=file1 )
|
||||||
print( file=file1 )
|
print( file=file1 )
|
||||||
elif ( input_data.Equation_Class == "BSSN-EScalar" ):
|
except ValueError:
|
||||||
print( "#define ABEtype 1", file=file1 )
|
|
||||||
print( file=file1 )
|
|
||||||
elif ( input_data.Equation_Class == "BSSN-EM" ):
|
|
||||||
print( "#define ABEtype 3", file=file1 )
|
|
||||||
print( file=file1 )
|
|
||||||
elif ( input_data.Equation_Class == "Z4C" ):
|
|
||||||
print( "#define ABEtype 2", file=file1 )
|
|
||||||
print( file=file1 )
|
|
||||||
else:
|
|
||||||
print( "Equation_Class setting error!!!" )
|
print( "Equation_Class setting error!!!" )
|
||||||
print()
|
print()
|
||||||
print( "# Equation type #define ABEtype setting error!!!", file=file1 )
|
print( "# Equation type #define ABEtype setting error!!!", file=file1 )
|
||||||
@@ -144,6 +166,62 @@ def generate_macrodef_h():
|
|||||||
print( "#define REGLEV 0", file=file1 )
|
print( "#define REGLEV 0", file=file1 )
|
||||||
print( file=file1 )
|
print( file=file1 )
|
||||||
|
|
||||||
|
# Define fine-grained timing/debug macros.
|
||||||
|
# All of them default to OFF so production builds do not pay profiling overhead.
|
||||||
|
|
||||||
|
fine_timing = getattr(input_data, "Fine_Timing",
|
||||||
|
getattr(input_data, "Finegrained_Timing", "no"))
|
||||||
|
kernel_fine_timing = getattr(input_data, "Kernel_Fine_Timing",
|
||||||
|
getattr(input_data, "BSSN_Kernel_Fine_Timing", "no"))
|
||||||
|
stdin_abort_poll = getattr(input_data, "Enable_Stdin_Abort_Poll",
|
||||||
|
getattr(input_data, "Stdin_Abort_Poll", "no"))
|
||||||
|
timing_report_every = max(1, int(getattr(
|
||||||
|
input_data, "Timing_Every_Steps",
|
||||||
|
getattr(input_data, "Timing_Report_Every", 1))))
|
||||||
|
timing_top_hotspots = max(1, int(getattr(
|
||||||
|
input_data, "Timing_Top_Hotspots", 8)))
|
||||||
|
|
||||||
|
if ( fine_timing == "yes" ):
|
||||||
|
print( "#define BSSN_FINE_TIMING 1", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
elif ( fine_timing == "no" ):
|
||||||
|
print( "#define BSSN_FINE_TIMING 0", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
else:
|
||||||
|
print( "Fine_Timing setting error!!!" )
|
||||||
|
print()
|
||||||
|
print( "# Fine_Timing setting error!!!", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
|
||||||
|
print( f"#define BSSN_FINE_TIMING_EVERY {timing_report_every}", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
print( f"#define BSSN_FINE_TIMING_TOPN {timing_top_hotspots}", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
|
||||||
|
if ( kernel_fine_timing == "yes" ):
|
||||||
|
print( "#define BSSN_KERNEL_FINE_TIMING 1", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
elif ( kernel_fine_timing == "no" ):
|
||||||
|
print( "#define BSSN_KERNEL_FINE_TIMING 0", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
else:
|
||||||
|
print( "Kernel_Fine_Timing setting error!!!" )
|
||||||
|
print()
|
||||||
|
print( "# Kernel_Fine_Timing setting error!!!", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
|
||||||
|
if ( stdin_abort_poll == "yes" ):
|
||||||
|
print( "#define BSSN_ENABLE_STDIN_ABORT_POLL 1", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
elif ( stdin_abort_poll == "no" ):
|
||||||
|
print( "#define BSSN_ENABLE_STDIN_ABORT_POLL 0", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
else:
|
||||||
|
print( "Enable_Stdin_Abort_Poll setting error!!!" )
|
||||||
|
print()
|
||||||
|
print( "# Enable_Stdin_Abort_Poll setting error!!!", file=file1 )
|
||||||
|
print( file=file1 )
|
||||||
|
|
||||||
# Define macro USE_GPU
|
# Define macro USE_GPU
|
||||||
# use GPU or not
|
# use GPU or not
|
||||||
|
|
||||||
@@ -224,6 +302,21 @@ def generate_macrodef_h():
|
|||||||
print( "// 0: for every level;", file=file1 )
|
print( "// 0: for every level;", file=file1 )
|
||||||
print( "// 1: for all", file=file1 )
|
print( "// 1: for all", file=file1 )
|
||||||
print( "//", file=file1 )
|
print( "//", file=file1 )
|
||||||
|
print( "// define BSSN_FINE_TIMING", file=file1 )
|
||||||
|
print( "// enable fine-grained per-timestep timing monitor", file=file1 )
|
||||||
|
print( "//", file=file1 )
|
||||||
|
print( "// define BSSN_FINE_TIMING_EVERY", file=file1 )
|
||||||
|
print( "// report timing every N coarse timesteps", file=file1 )
|
||||||
|
print( "//", file=file1 )
|
||||||
|
print( "// define BSSN_FINE_TIMING_TOPN", file=file1 )
|
||||||
|
print( "// number of hottest timing buckets shown in stdout", file=file1 )
|
||||||
|
print( "//", file=file1 )
|
||||||
|
print( "// define BSSN_KERNEL_FINE_TIMING", file=file1 )
|
||||||
|
print( "// enable split timing inside compute_rhs_bssn", file=file1 )
|
||||||
|
print( "//", file=file1 )
|
||||||
|
print( "// define BSSN_ENABLE_STDIN_ABORT_POLL", file=file1 )
|
||||||
|
print( "// poll stdin and broadcast abort flag every coarse step", file=file1 )
|
||||||
|
print( "//", file=file1 )
|
||||||
print( "// define USE_GPU", file=file1 )
|
print( "// define USE_GPU", file=file1 )
|
||||||
print( "// use gpu or not", file=file1 )
|
print( "// use gpu or not", file=file1 )
|
||||||
print( "//", file=file1 )
|
print( "//", file=file1 )
|
||||||
|
|||||||
@@ -43,7 +43,8 @@ def get_last_n_cores_per_socket(n=32):
|
|||||||
cpu_str = ",".join(segments)
|
cpu_str = ",".join(segments)
|
||||||
total = len(segments) * n
|
total = len(segments) * n
|
||||||
print(f" CPU binding: taskset -c {cpu_str} ({total} cores, last {n} per socket)")
|
print(f" CPU binding: taskset -c {cpu_str} ({total} cores, last {n} per socket)")
|
||||||
return f"taskset -c {cpu_str}"
|
#return f"taskset -c {cpu_str}"
|
||||||
|
return f""
|
||||||
|
|
||||||
|
|
||||||
## CPU core binding: dynamically select the last 32 cores of each socket (64 cores total)
|
## CPU core binding: dynamically select the last 32 cores of each socket (64 cores total)
|
||||||
@@ -69,7 +70,7 @@ def makefile_ABE():
|
|||||||
|
|
||||||
## Build command with CPU binding to nohz_full cores
|
## Build command with CPU binding to nohz_full cores
|
||||||
if (input_data.GPU_Calculation == "no"):
|
if (input_data.GPU_Calculation == "no"):
|
||||||
makefile_command = f"{NUMACTL_CPU_BIND} make -j{BUILD_JOBS} INTERP_LB_MODE=optimize ABE"
|
makefile_command = f"{NUMACTL_CPU_BIND} make -j{BUILD_JOBS} INTERP_LB_MODE=off ABE"
|
||||||
elif (input_data.GPU_Calculation == "yes"):
|
elif (input_data.GPU_Calculation == "yes"):
|
||||||
makefile_command = f"{NUMACTL_CPU_BIND} make -j{BUILD_JOBS} ABEGPU"
|
makefile_command = f"{NUMACTL_CPU_BIND} make -j{BUILD_JOBS} ABEGPU"
|
||||||
else:
|
else:
|
||||||
|
|||||||
@@ -1,97 +0,0 @@
|
|||||||
# AMSS-NCKU PGO Profile Analysis Report
|
|
||||||
|
|
||||||
## 1. Profiling Environment
|
|
||||||
|
|
||||||
| Item | Value |
|
|
||||||
|------|-------|
|
|
||||||
| Compiler | Intel oneAPI DPC++/C++ 2025.3.0 (icpx/ifx) |
|
|
||||||
| Instrumentation Flag | `-fprofile-instr-generate` |
|
|
||||||
| Optimization Level (instrumented) | `-O2 -xHost -fma` |
|
|
||||||
| MPI Processes | 1 (single process to avoid MPI+instrumentation deadlock) |
|
|
||||||
| Profile File | `default_9725750769337483397_0.profraw` (327 KB) |
|
|
||||||
| Merged Profile | `default.profdata` (394 KB) |
|
|
||||||
| llvm-profdata | `/home/intel/oneapi/compiler/2025.3/bin/compiler/llvm-profdata` |
|
|
||||||
|
|
||||||
## 2. Reduced Simulation Parameters (for profiling run)
|
|
||||||
|
|
||||||
| Parameter | Production Value | Profiling Value |
|
|
||||||
|-----------|-----------------|-----------------|
|
|
||||||
| MPI_processes | 64 | 1 |
|
|
||||||
| grid_level | 9 | 4 |
|
|
||||||
| static_grid_level | 5 | 3 |
|
|
||||||
| static_grid_number | 96 | 24 |
|
|
||||||
| moving_grid_number | 48 | 16 |
|
|
||||||
| largest_box_xyz_max | 320^3 | 160^3 |
|
|
||||||
| Final_Evolution_Time | 1000.0 | 10.0 |
|
|
||||||
| Evolution_Step_Number | 10,000,000 | 1,000 |
|
|
||||||
| Detector_Number | 12 | 2 |
|
|
||||||
|
|
||||||
## 3. Profile Summary
|
|
||||||
|
|
||||||
| Metric | Value |
|
|
||||||
|--------|-------|
|
|
||||||
| Total instrumented functions | 1,392 |
|
|
||||||
| Functions with non-zero counts | 117 (8.4%) |
|
|
||||||
| Functions with zero counts | 1,275 (91.6%) |
|
|
||||||
| Maximum function entry count | 386,459,248 |
|
|
||||||
| Maximum internal block count | 370,477,680 |
|
|
||||||
| Total block count | 4,198,023,118 |
|
|
||||||
|
|
||||||
## 4. Top 20 Hotspot Functions
|
|
||||||
|
|
||||||
| Rank | Total Count | Max Block Count | Function | Category |
|
|
||||||
|------|------------|-----------------|----------|----------|
|
|
||||||
| 1 | 1,241,601,732 | 370,477,680 | `polint_` | Interpolation |
|
|
||||||
| 2 | 755,994,435 | 230,156,640 | `prolong3_` | Grid prolongation |
|
|
||||||
| 3 | 667,964,095 | 3,697,792 | `compute_rhs_bssn_` | BSSN RHS evolution |
|
|
||||||
| 4 | 539,736,051 | 386,459,248 | `symmetry_bd_` | Symmetry boundary |
|
|
||||||
| 5 | 277,310,808 | 53,170,728 | `lopsided_` | Lopsided FD stencil |
|
|
||||||
| 6 | 155,534,488 | 94,535,040 | `decide3d_` | 3D grid decision |
|
|
||||||
| 7 | 119,267,712 | 19,266,048 | `rungekutta4_rout_` | RK4 time integrator |
|
|
||||||
| 8 | 91,574,616 | 48,824,160 | `kodis_` | Kreiss-Oliger dissipation |
|
|
||||||
| 9 | 67,555,389 | 43,243,680 | `fderivs_` | Finite differences |
|
|
||||||
| 10 | 55,296,000 | 42,246,144 | `misc::fact(int)` | Factorial utility |
|
|
||||||
| 11 | 43,191,071 | 27,663,328 | `fdderivs_` | 2nd-order FD derivatives |
|
|
||||||
| 12 | 36,233,965 | 22,429,440 | `restrict3_` | Grid restriction |
|
|
||||||
| 13 | 24,698,512 | 17,231,520 | `polin3_` | Polynomial interpolation |
|
|
||||||
| 14 | 22,962,942 | 20,968,768 | `copy_` | Data copy |
|
|
||||||
| 15 | 20,135,696 | 17,259,168 | `Ansorg::barycentric(...)` | Spectral interpolation |
|
|
||||||
| 16 | 14,650,224 | 7,224,768 | `Ansorg::barycentric_omega(...)` | Spectral weights |
|
|
||||||
| 17 | 13,242,296 | 2,871,920 | `global_interp_` | Global interpolation |
|
|
||||||
| 18 | 12,672,000 | 7,734,528 | `sommerfeld_rout_` | Sommerfeld boundary |
|
|
||||||
| 19 | 6,872,832 | 1,880,064 | `sommerfeld_routbam_` | Sommerfeld boundary (BAM) |
|
|
||||||
| 20 | 5,709,900 | 2,809,632 | `l2normhelper_` | L2 norm computation |
|
|
||||||
|
|
||||||
## 5. Hotspot Category Breakdown
|
|
||||||
|
|
||||||
Top 20 functions account for ~98% of total execution counts:
|
|
||||||
|
|
||||||
| Category | Functions | Combined Count | Share |
|
|
||||||
|----------|-----------|---------------|-------|
|
|
||||||
| Interpolation / Prolongation / Restriction | polint_, prolong3_, restrict3_, polin3_, global_interp_, Ansorg::* | ~2,093M | ~50% |
|
|
||||||
| BSSN RHS + FD stencils | compute_rhs_bssn_, lopsided_, fderivs_, fdderivs_ | ~1,056M | ~25% |
|
|
||||||
| Boundary conditions | symmetry_bd_, sommerfeld_rout_, sommerfeld_routbam_ | ~559M | ~13% |
|
|
||||||
| Time integration | rungekutta4_rout_ | ~119M | ~3% |
|
|
||||||
| Dissipation | kodis_ | ~92M | ~2% |
|
|
||||||
| Utilities | misc::fact, decide3d_, copy_, l2normhelper_ | ~256M | ~6% |
|
|
||||||
|
|
||||||
## 6. Conclusions
|
|
||||||
|
|
||||||
1. **Profile data is valid**: 1,392 functions instrumented, 117 exercised with ~4.2 billion total counts.
|
|
||||||
2. **Hotspot concentration is high**: Top 5 functions alone account for ~76% of all counts, which is ideal for PGO — the compiler has strong branch/layout optimization targets.
|
|
||||||
3. **Fortran numerical kernels dominate**: `polint_`, `prolong3_`, `compute_rhs_bssn_`, `symmetry_bd_`, `lopsided_` are all Fortran routines in the inner evolution loop. PGO will optimize their branch prediction and basic block layout.
|
|
||||||
4. **91.6% of functions have zero counts**: These are code paths for unused features (GPU, BSSN-EScalar, BSSN-EM, Z4C, etc.). PGO will deprioritize them, improving instruction cache utilization.
|
|
||||||
5. **Profile is representative**: Despite the reduced grid size, the code path coverage matches production — the same kernels (RHS, prolongation, restriction, boundary) are exercised. PGO branch probabilities from this profile will transfer well to full-scale runs.
|
|
||||||
|
|
||||||
## 7. PGO Phase 2 Usage
|
|
||||||
|
|
||||||
To apply the profile, use the following flags in `makefile.inc`:
|
|
||||||
|
|
||||||
```makefile
|
|
||||||
CXXAPPFLAGS = -O3 -xHost -fp-model fast=2 -fma -ipo \
|
|
||||||
-fprofile-instr-use=/home/amss/AMSS-NCKU/pgo_profile/default.profdata \
|
|
||||||
-Dfortran3 -Dnewc -I${MKLROOT}/include
|
|
||||||
f90appflags = -O3 -xHost -fp-model fast=2 -fma -ipo \
|
|
||||||
-fprofile-instr-use=/home/amss/AMSS-NCKU/pgo_profile/default.profdata \
|
|
||||||
-align array64byte -fpp -I${MKLROOT}/include
|
|
||||||
```
|
|
||||||
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Reference in New Issue
Block a user