International Conference on Fast Numerical Algorithms and Applications (ICFNAA - 27)

This track focuses on the latest developments in fast numerical algorithms that enhance computational efficiency. Researchers are invited to present innovative techniques that significantly reduce computation time while maintaining accuracy.

This session explores the integration of high-performance computing with numerical methods to solve complex mathematical problems. Contributions that demonstrate the effectiveness of parallel processing and distributed computing are particularly welcome.

This track is dedicated to iterative methods designed for large-scale numerical problems, emphasizing convergence speed and stability. Participants are encouraged to share their findings on new algorithms and their applications in various fields.

This session highlights advancements in direct solvers specifically tailored for sparse matrix systems. Papers discussing novel approaches that improve efficiency and scalability in solving large sparse linear systems are encouraged.

This track delves into Krylov subspace methods, focusing on their theoretical foundations and practical applications. Researchers are invited to submit papers that explore new variants and their performance in real-world scenarios.

This session examines various preconditioning techniques that enhance the performance of iterative solvers. Contributions that demonstrate the impact of preconditioning on convergence rates and computational efficiency are highly sought after.