Philippe-André Luneau

About Me

I am a PhD student from the mathematics and statistics department at Université Laval since the winter of 2023. My work is focused on numerical optimization and its application to natural sciences and engineering. I also occasionally give lectures for undergraduate engineering/math students. I have always had a great interest into mixing together mathematical abstractions with the great effectiveness of computer science to visualize beautiful results and physical phenomena.

In my free time, I take care of my two cats Chebyshev (top picture) and Minkowski (bottom picture), I go out with my friends for drinks or concerts, I read, I write music and, sometimes, I try other artistic/tech activities (like making a website...). I also have the bad habit of always trying new italian recipes.

Academic Background

Professional Background

Other Experiences

Recognition & Scholarships

Research

My research interests are mostly revolving around applied mathematics, scientific computing and numerical analysis. I am specialized in numerical optimization and its application to design problems like shape and topology optimization (the subject of my master's degree). I am familiar with continuum mechanics, the finite element method, density-based topology optimization, and most well-known numerical optimization algorithms (descent methods, dual methods, evolutionary algorithms, etc.)

For my PhD, I am studying dimensionality reduction techniques (ROM, active subspaces, compressive sensing, random embeddings) and their application to the resolution of high-dimensional optimization problems. Ultimately, the goal will be to be able to use those techniques for realistic topology optimization instances if possible. We hope that they can allow to find acceptable solutions in more reasonable time than classical methods like FEM.

Publications

Presentations

Teaching

Lectures

TA

Supervision

Projects

Music

Engraving

Contact

Elements

i = 0;

while (!deck.isInOrder()) {
    print 'Iteration ' + i;
    deck.shuffle();
    i++;
}

print 'It took ' + i + ' iterations to sort the deck.';