https://gcc.gnu.org/bugzilla/show_bug.cgi?id=107753
--- Comment #3 from anlauf at gcc dot gnu.org --- I guess the reporter assumes that gcc uses a clever algorithm like Smith's to handle such extreme cases of complex division. Not sure if that one is available by some compilation flag, and I think it would impact performance. In any case, if the reporter wants to get robust results and in a portable way, I would advise him to change/fix his algorithm accordingly. It appears that a few other compilers behave here like gfortran.
