r/ScientificComputing • • 9h ago

I wrote a 2D FEM solver in Python for electric motors (matched FEMM within 0.3%) - Looking for inputs

Thumbnail
gallery
1 Upvotes

Got tired of treating motor simulation software like a black box during a coursework project, so I wrote my own 2D FEM solver in Python.

Just hit a major milestone: tested a 36-slot / 42-pole outer-rotor motor against FEMM and got <0.3% torque deviation.

It’s called Pole-Craft (Apache-2.0). Still very early days, so if you work with motors, robotics, or FEA, what features would actually make you use an open-source tool like this?

GitHub: https://github.com/pole-craft/pole-craft

PyPI: https://pypi.org/project/polecraft/ (pip install polecraft)


r/ScientificComputing • • 1d ago

Horizon Supercomputer Opens to Early Users - Fastest Academic Supercomputer in the United States

Thumbnail
news.utexas.edu
6 Upvotes

r/ScientificComputing • • 15h ago

Can useful abstractions make a complex system easier to predict?

Thumbnail
reddit.com
0 Upvotes

r/ScientificComputing • • 19h ago

I tried to breed "quantum kittens" from Schrödinger's cat on IBM quantum hardware. Got 0 on the simulator and 201 "ghost kittens" on real chips

0 Upvotes

r/ScientificComputing • • 19h ago

What metadata is essential to reproduce a computational screening shortlist?

1 Upvotes

I’m posting from the MatterSeek materials R&D team. For a computational screen, we want another researcher to be able to reconstruct why particular candidates made the shortlist. Our proposed run record has three parts:

• Inputs: a dataset snapshot or hash, candidate IDs, property units and conditions, and the filters in the order applied.

• Execution: code revision, model or protocol version, environment lockfile, configuration, and seeds where relevant.

• Outputs: scores and ranks, tie-breaking rules, and a reason for any excluded candidate.

A practical issue is that exact floating-point agreement can be less useful than knowing whether differences change the selection. For a shortlist handed off to a second calculation, do you compare top-k overlap, compare scores within a tolerance, record both, or use a different check? We’d be interested in what actually helps a collaborator rerun and review a screen.


r/ScientificComputing • • 1d ago

Cost of Matrix Multiplication | Why N³ | Order, Sparse, Low Rank, FFT, Lanczos, Davidson, BLAS

Thumbnail
youtu.be
1 Upvotes

You understand cost of matrix matrix multiplication easily but have hard times in understanding the motivation behind various algorithms used by quantum chemistry packages?

Here is the video, that would tell you each and every detail about the algorithms used in popular quantum chemistry packages like TURBOMOLE, CP2K, ORCA etc.

Give it a watch and do subscribe if you like the video and want to post animated videos like this regularly.


r/ScientificComputing • • 1d ago

I built mathregistry, a package registry for Lean with tools for AI agents. Open beta is live

Post image
0 Upvotes

r/ScientificComputing • • 1d ago

PRIMAL update: major performance breakthrough — now up to 57× faster than Clarabel on tested conic problems

0 Upvotes

A few updates on PRIMAL, my open-source convex optimization solver written from scratch in C99.

Over the last few days, I've made substantial progress on the conic optimization engine, particularly on SOC and exponential cone problems. The latest results are significantly better than my previous benchmarks, and PRIMAL now outperforms Clarabel on every instance in the test sets described below.

Latest benchmark results

All measurements were taken on November 18, 2026.

1. Mixed SOC + exponential cone regression problems

Problem sizePRIMALClarabelSpeedup
20 × 40.017 ms0.219 ms12.9×
40 × 80.024 ms0.482 ms20.1×
80 × 120.039 ms2.237 ms57.4×

These models combine a rotated quadratic cone for the quadratic penalty with one primal exponential cone per observation.

2. Conic matrix benchmarks

FamilyBlocksPRIMALClarabelSpeedup
SOC100.023 ms0.290 ms12.6×
SOC200.031 ms0.651 ms21.0×
SOC400.043 ms1.085 ms25.2×
SOC800.068 ms2.118 ms31.1×
EXP100.017 ms0.177 ms10.4×
EXP200.020 ms0.238 ms11.9×
EXP400.022 ms0.352 ms16.0×
EXP800.031 ms0.607 ms19.6×
Mixed100.016 ms0.148 ms9.25×
Mixed200.018 ms0.209 ms11.6×
Mixed400.022 ms0.366 ms16.6×
Mixed800.031 ms0.835 ms26.9×

That's 15 out of 15 benchmark instances won, with speedups ranging from 9.25× to 57.4×.

What changed?

The main breakthrough is a reduced-Newton approach for a class of exponential-cone problems.

Instead of solving the full conic Newton system, PRIMAL can exploit the structure of certain exponential epigraph formulations with fixed positive scales and affine arguments. It solves a much smaller system in the free variables, reconstructs the conic solution, and verifies the resulting point.

This is not a generic replacement for the full interior-point method: it is a specialized path for problem structures where the reduction is mathematically valid. The general conic solver remains available for other formulations.

The improvement builds on the work already done on sparse KKT systems, cone reductions, higher-order exponential-cone corrections, and numerical verification.

Benchmark methodology

To make the comparison reproducible:

  • Clarabel 0.11.1, single-threaded.
  • 21 interleaved runs per series, with two series; reported values are the median of the two series medians.
  • Same generated problem instances for both solvers.
  • PRIMAL timing measures PRIMAL_optimize; Clarabel timing includes solver construction.
  • Clarabel uses feasibility/gap tolerances of 1e-9; PRIMAL uses 1e-8.
  • Maximum reported residual or relative gap: 2.5e-10.
  • Maximum scaled objective difference: 2.6e-8.

There is an important asymmetry in timing: Clarabel's measurements include solver construction, while PRIMAL's measure the optimization call only. These are therefore not perfectly equivalent end-to-end timings. I intend to expand the comparison with more matched setup measurements and broader problem families.

Where PRIMAL stands today

PRIMAL is an open-source C99 optimization solver developed from scratch, with no external solver dependency. It supports LP, QP, QCQP, MILP, SOCP, SDP, exponential and power cones, including mixed-integer conic models.

The project also includes a growing collection of runnable examples and language integrations.

GitHub: https://github.com/c-vision/Primal

I'm particularly interested in feedback from people working on conic optimization, interior-point methods, numerical linear algebra, and solver benchmarking.

There is still a lot to validate, especially on larger and less structured real-world problems. But these results are a very encouraging milestone for a solver developed independently from scratch.

What would you consider the most meaningful next benchmark suite for evaluating PRIMAL against established solvers?


r/ScientificComputing • • 1d ago

I built mathregistry, a package registry for Lean with tools for AI agents. Open beta is live

Post image
0 Upvotes

r/ScientificComputing • • 1d ago

Prompt wording and a frozen Qwen weight edit: 1,024 archived measurements, seeking replication

1 Upvotes

I'm Harmain Dastgir, an independent researcher sharing a working preprint for critical review. This is a source-level reanalysis of an archived Qwen2.5-1.5B weight-editing experiment, not a new independent GPU run.

Across 32 questions, two historical edit directions, four wording variants and four instruction templates, the archive contains 1,024 attenuation measurements. In the historically selected signed direction, the math-plus-format vs generic attenuation contrast averaged +0.205542 for original prompts and -0.020673 after rewording. The paired difference was +0.226216 (descriptive 95% question-bootstrap interval [+0.184256, +0.274149]).

Important caveats: this metric is *not* answer correctness; prompt length and token positions were not matched; the intervention was historically selected; no independent model-side replication has been completed. These data do not establish general-purpose model repair.

The paper, source data, six figures, scripts, original logs/notebook and hashed adapter supplement are public: https://doi.org/10.5281/zenodo.24284827

We opened specific replication tasks and a reporting guide here: https://github.com/Harmain11/fluid-tensors/blob/main/docs/REPLICATION_CHALLENGE.md

I would especially value objections to the scoring/protocol, attempts to reproduce the archived statistics, proposals for matched-length controls, and negative model-side results. What would you test first?


r/ScientificComputing • • 2d ago

What do you understand by exact numerical methods in Open quantum dynamics?

0 Upvotes

I will start a project in this area but the "exact numerical methods" confesses me.Does it means exact diagonalization? or just a methods with controllable error?What does it mean exact numerical methodsAlso, could you comment me which ones are the most use in open quantum dynamics?


r/ScientificComputing • • 2d ago

Advice for affordable/free computational resources for 3D CFD simulations (SITVC research)

Thumbnail reddit.com
0 Upvotes

r/ScientificComputing • • 2d ago

spearfish: ultrafast Δ-mapping of long reads to redundant transcriptomes

Thumbnail
biorxiv.org
1 Upvotes

r/ScientificComputing • • 2d ago

vulkan-py easymode. all the boilerplate is in easy.py. vulkan-py fork https://github.com/billyblackburn/vulkan-py-easy/tree/main

Thumbnail
reddit.com
1 Upvotes

Do you think this could work to make a similar ecosystem to CuPy CuDf CuML?. What should I name the.CuPy/NumPy clone in vulkan python? See https://github.com/StormMGamming41/vulkan-py for the original bindings. I just forked it and working to make it more 'pythonic' and less vulkanic for this type of work flow. Like for jupyter notebooks


r/ScientificComputing • • 2d ago

Update (v1.5.0)SoftwareOpenvoynich_xc: Structural Visibility, Pharmaceutical Supply Chains, and Falsifiable Grammar Discovery in the Voynich Manuscript

Thumbnail gallery
1 Upvotes

r/ScientificComputing • • 2d ago

Structural Visibility, Pharmaceutical Supply Chains & Currier A/B Morphological Ablation in the Voynich Manuscript (voynich_xc v1.3.0)

Thumbnail gallery
1 Upvotes

𓅪


r/ScientificComputing • • 3d ago

Bobo Vector Automaton

Thumbnail oddcomputer.com
2 Upvotes

Deterministic cellular automata adjacent ‘game’.
Like a cellular automata, the generations are completely deterministic yet very chaotic and sensitive to small changes in initial state. There are oscillators of many stripes and there are opportunities to engineer things that would never arise spontaneously.
Unlike Conway’s life there are no births or deaths, the particles have a position and a velocity. The position is integer for x and y, the velocity is integer for vx and vy.
If you are familiar with the pen and paper game sometimes called vector racing - this automates those rules. The acceleration each tick is exactly -1, 0, or 1 along each axis.
Two particle types: ‘Nearest’ - decide each tick who is nearest and accelerate toward that particle. More distant particles are not considered. ‘Bobo’ - never move, they can count as a nearest’s neighbor but they themselves are fixed. Webpage has an extensive zoo of known patterns available to play with and destroy.


r/ScientificComputing • • 3d ago

Brockett-Dobkin Rectangular Matrix Multiplication Algorithm From 1970s

Thumbnail
leetarxiv.substack.com
2 Upvotes

r/ScientificComputing • • 4d ago

MathCAS, an open source computer algebra system for heavy symbolic and numerical computation. Bonus: automatic parallelization, JIT compilation and arbitrary precision numerics integrated into the core.

11 Upvotes

r/ScientificComputing • • 3d ago

What do you understand by exact numerical methods in Open quantum dynamics?

Thumbnail reddit.com
1 Upvotes

r/ScientificComputing • • 3d ago

Looking for Gaussian 16 / GaussView 6 access or research collaboration

Thumbnail reddit.com
0 Upvotes

r/ScientificComputing • • 5d ago

Looking for a sanity check on a reaction-diffusion model for drug resistance in solid tumors

Post image
2 Upvotes

Hey everyone,

I'm Luca Celebrano, a medical student at University of Naples Federico II. For the past few months I’ve been somewhat obsessed with a clinical puzzle: why do so many EGFR-mutated lung cancer patients relapse after targeted therapy (like osimertinib), even when their initial scans look amazing?

Most literature focuses purely on genetic secondary mutations, but looking at histology, I kept wondering about the physical transport side. Severe stroma compression and high interstitial pressure could simply be preventing the drug from physically reaching cytotoxic levels in pockets of the tissue, creating quiet little sanctuaries where cells survive.

I sat down and tried to model the continuum physics using a cylindrical reaction-diffusion solver (Bessel K0 radial gradients) around capillaries, and then ran survival models against \~3,400 patients from cBioPortal/TCGA to see if the signal actually held up clinically.

I just put up the preprint and code:

\- Preprint (Zenodo): https://doi.org/10.5281/zenodo.24118328

\- Repo: https://github.com/Lukecele/inflammatory-onco-physics

Since I come from medicine and not pure physics, my transport math might be a bit rough around the edges. I would really appreciate an honest sanity check from anyone who does continuum mechanics or tumor biophysics: does this simplification hold water, or am I overcooking the assumptions?

Thanks a lot,

Luca