algorithm developer locuri de muncă în Iași

We are looking for an Algorithm Developer for a highly technical and rewarding project in the field of carbon fiber winding and structural analysis for composite high-pressure hydrogen storage vessels. The ideal candidate will develop, prototype, and validate mathematical models for fiber-reinforced structures based on scientific research and engineering theory. Your work will directly contribute to improving simulation capabilities, optimizing vessel design, and enhancing performance prediction across a range of operating conditions.

Key Responsibilities

• Translate and implement closed-form analytical models from scientific literature (e.g., 3D elasticity theory, Classical Laminate Theory)
• Simulate and validate fiber lay-ups, asymmetric windings, and multi-layered stress behavior
• Develop prototype code in Python, MATLAB, or C++ for algorithm validation
• Provide technical documentation and guide the handoff of validated models for production integration
• Collaborate closely with engineers and developers to ensure model fidelity and software compatibility
• Support performance benchmarking, sensitivity analysis, and algorithm refinement

Required Qualifications

• Bachelors or Masters degree in Engineering, Applied Mathematics, Physics, or a related field
• Solid experience with Python and/or MATLAB for scientific and numerical computing
• Strong understanding of mathematical modeling and composite material mechanics
• Proven ability to implement models from academic papers or theoretical specifications
• Problem-solving mindset with clear analytical and coding skills
• Good written and verbal communication skills in English

Nice to Have

• Familiarity with C++, especially for scientific or high-performance computing
• Knowledge of fiber winding simulation, laminate theory, or composite failure criteria
• Experience with finite element tools like Abaqus
• Exposure to material optimization or multi-physics modeling
• Version control experience (Git, Azure DevOps, etc.)